YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:21:38,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:21:38,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:21:38,258 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:21:38,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:21:38,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:21:38,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:21:38,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:21:38,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:21:38,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:21:38,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:21:38,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:21:38,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:21:38,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:21:38,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:21:38,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:21:38,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:21:38,272 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:21:38,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:21:38,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:21:38,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:21:38,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:21:38,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:21:38,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:21:38,280 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:21:38,280 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:21:38,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:21:38,282 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:21:38,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:21:38,283 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:21:38,283 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:21:38,284 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:21:38,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:21:38,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:21:38,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:21:38,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:21:38,286 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:21:38,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:21:38,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:21:38,288 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:21:38,302 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:21:38,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:21:38,304 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:21:38,304 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:21:38,304 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:21:38,304 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:21:38,305 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:21:38,305 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:21:38,305 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:21:38,305 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:21:38,305 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:21:38,305 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:21:38,306 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:21:38,306 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:21:38,306 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:21:38,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:21:38,306 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:21:38,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:21:38,307 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:21:38,307 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:21:38,307 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:21:38,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:21:38,307 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:21:38,307 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:21:38,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:21:38,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:21:38,308 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:21:38,308 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:21:38,308 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:21:38,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:21:38,349 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:21:38,352 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:21:38,353 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:21:38,354 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:21:38,355 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:21:38,425 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/41cde2145a1749f98bb674b634f818de/FLAG4a1f37373 [2020-06-22 10:21:38,772 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:21:38,773 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:21:38,773 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:21:38,779 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/41cde2145a1749f98bb674b634f818de/FLAG4a1f37373 [2020-06-22 10:21:39,180 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/41cde2145a1749f98bb674b634f818de [2020-06-22 10:21:39,192 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:21:39,193 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:21:39,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:21:39,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:21:39,198 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:21:39,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aab65f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39, skipping insertion in model container [2020-06-22 10:21:39,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:21:39,226 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:21:39,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:21:39,448 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:21:39,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:21:39,482 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:21:39,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39 WrapperNode [2020-06-22 10:21:39,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:21:39,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:21:39,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:21:39,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:21:39,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:21:39,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:21:39,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:21:39,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:21:39,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:21:39,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:21:39,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:21:39,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:21:39,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:21:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:21:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:21:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:21:39,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:21:39,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:21:39,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:21:39,966 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:21:39,966 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:21:39,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:21:39 BoogieIcfgContainer [2020-06-22 10:21:39,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:21:39,970 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:21:39,971 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:21:39,973 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:21:39,974 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:21:39" (1/1) ... [2020-06-22 10:21:39,993 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 41 edges [2020-06-22 10:21:39,994 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:21:39,995 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:21:39,996 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:21:39,996 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:21:39,998 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:21:39,999 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:21:39,999 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:21:40,022 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:21:40,055 INFO L200 BlockEncoder]: SBE split 21 edges [2020-06-22 10:21:40,060 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:21:40,062 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:21:40,091 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 10:21:40,094 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:21:40,095 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:21:40,096 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:21:40,096 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:21:40,097 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:21:40,097 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 60 edges [2020-06-22 10:21:40,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:21:40 BasicIcfg [2020-06-22 10:21:40,098 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:21:40,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:21:40,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:21:40,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:21:40,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:21:39" (1/4) ... [2020-06-22 10:21:40,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:21:40, skipping insertion in model container [2020-06-22 10:21:40,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (2/4) ... [2020-06-22 10:21:40,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:21:40, skipping insertion in model container [2020-06-22 10:21:40,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:21:39" (3/4) ... [2020-06-22 10:21:40,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:21:40, skipping insertion in model container [2020-06-22 10:21:40,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:21:40" (4/4) ... [2020-06-22 10:21:40,108 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:21:40,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:21:40,127 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-06-22 10:21:40,144 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-06-22 10:21:40,172 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:21:40,173 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:21:40,173 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:21:40,174 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:21:40,174 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:21:40,174 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:21:40,174 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:21:40,174 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:21:40,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:21:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-06-22 10:21:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:21:40,195 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:40,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:21:40,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:21:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:40,203 INFO L82 PathProgramCache]: Analyzing trace with hash 111352, now seen corresponding path program 1 times [2020-06-22 10:21:40,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:40,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:40,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:40,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:40,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:40,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:40,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:40,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:40,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:40,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:40,414 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-06-22 10:21:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:40,584 INFO L93 Difference]: Finished difference Result 33 states and 60 transitions. [2020-06-22 10:21:40,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:40,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:21:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:40,599 INFO L225 Difference]: With dead ends: 33 [2020-06-22 10:21:40,600 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 10:21:40,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 10:21:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 10:21:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:21:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 56 transitions. [2020-06-22 10:21:40,643 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 56 transitions. Word has length 3 [2020-06-22 10:21:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:40,644 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 56 transitions. [2020-06-22 10:21:40,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 56 transitions. [2020-06-22 10:21:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:21:40,645 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:40,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:21:40,646 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:21:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash 111354, now seen corresponding path program 1 times [2020-06-22 10:21:40,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:40,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:40,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:40,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:40,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:40,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:40,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:40,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:40,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:40,680 INFO L87 Difference]: Start difference. First operand 31 states and 56 transitions. Second operand 3 states. [2020-06-22 10:21:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:40,762 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2020-06-22 10:21:40,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:40,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:21:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:40,764 INFO L225 Difference]: With dead ends: 33 [2020-06-22 10:21:40,764 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 10:21:40,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 10:21:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 10:21:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:21:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2020-06-22 10:21:40,770 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 3 [2020-06-22 10:21:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:40,770 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2020-06-22 10:21:40,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2020-06-22 10:21:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:21:40,771 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:40,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:21:40,771 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:21:40,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash 111355, now seen corresponding path program 1 times [2020-06-22 10:21:40,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:40,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:40,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:40,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:40,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:40,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:40,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:40,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:40,816 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. [2020-06-22 10:21:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:40,919 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. [2020-06-22 10:21:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:40,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:21:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:40,921 INFO L225 Difference]: With dead ends: 31 [2020-06-22 10:21:40,921 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:21:40,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:21:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:21:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:21:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. [2020-06-22 10:21:40,926 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 3 [2020-06-22 10:21:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:40,926 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 52 transitions. [2020-06-22 10:21:40,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 52 transitions. [2020-06-22 10:21:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:21:40,927 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:40,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:21:40,927 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:21:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash 3449963, now seen corresponding path program 1 times [2020-06-22 10:21:40,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:40,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:40,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:40,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:40,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:40,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:40,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:40,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:40,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:40,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:40,967 INFO L87 Difference]: Start difference. First operand 29 states and 52 transitions. Second operand 3 states. [2020-06-22 10:21:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:41,054 INFO L93 Difference]: Finished difference Result 29 states and 52 transitions. [2020-06-22 10:21:41,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:41,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:21:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:41,055 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:21:41,055 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:21:41,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:21:41,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:21:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:21:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2020-06-22 10:21:41,060 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 4 [2020-06-22 10:21:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:41,060 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. [2020-06-22 10:21:41,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. [2020-06-22 10:21:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:21:41,061 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:41,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:21:41,061 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:21:41,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash 3449965, now seen corresponding path program 1 times [2020-06-22 10:21:41,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:41,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:41,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:41,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:41,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:41,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:41,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:41,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:41,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,101 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 3 states. [2020-06-22 10:21:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:41,196 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. [2020-06-22 10:21:41,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:41,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:21:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:41,197 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:21:41,198 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:21:41,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:21:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:21:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:21:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2020-06-22 10:21:41,202 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 4 [2020-06-22 10:21:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:41,202 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. [2020-06-22 10:21:41,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2020-06-22 10:21:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:21:41,203 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:41,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:21:41,203 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:21:41,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:41,203 INFO L82 PathProgramCache]: Analyzing trace with hash 3449966, now seen corresponding path program 1 times [2020-06-22 10:21:41,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:41,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:41,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:41,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:41,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:41,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:41,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:41,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,238 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 3 states. [2020-06-22 10:21:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:41,302 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. [2020-06-22 10:21:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:41,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:21:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:41,303 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:21:41,303 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 10:21:41,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 10:21:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:21:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:21:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2020-06-22 10:21:41,307 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 [2020-06-22 10:21:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:41,307 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. [2020-06-22 10:21:41,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. [2020-06-22 10:21:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:21:41,308 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:41,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:21:41,308 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:21:41,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash 106947311, now seen corresponding path program 1 times [2020-06-22 10:21:41,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:41,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:41,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:41,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:41,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:41,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:41,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:41,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:41,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,344 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. [2020-06-22 10:21:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:41,395 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-06-22 10:21:41,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:41,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:21:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:41,396 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:21:41,397 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:21:41,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:21:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:21:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:21:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2020-06-22 10:21:41,400 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 5 [2020-06-22 10:21:41,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:41,400 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 10:21:41,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. [2020-06-22 10:21:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:21:41,401 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:41,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:21:41,401 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:21:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:41,401 INFO L82 PathProgramCache]: Analyzing trace with hash 106947313, now seen corresponding path program 1 times [2020-06-22 10:21:41,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:41,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:41,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:41,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:41,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:41,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,428 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. [2020-06-22 10:21:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:41,479 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-06-22 10:21:41,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:41,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:21:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:41,481 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:21:41,481 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:21:41,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:21:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:21:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:21:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-06-22 10:21:41,486 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 5 [2020-06-22 10:21:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:41,486 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-06-22 10:21:41,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-06-22 10:21:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:21:41,487 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:41,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:21:41,487 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:21:41,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:41,487 INFO L82 PathProgramCache]: Analyzing trace with hash 106947314, now seen corresponding path program 1 times [2020-06-22 10:21:41,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:41,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:41,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:41,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:41,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:41,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:41,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,521 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 3 states. [2020-06-22 10:21:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:41,561 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-06-22 10:21:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:41,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:21:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:41,562 INFO L225 Difference]: With dead ends: 17 [2020-06-22 10:21:41,562 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:21:41,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:21:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:21:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:21:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:21:41,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 10:21:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:41,563 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:21:41,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:21:41,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:21:41,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:21:41,598 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 10:21:41,599 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 10:21:41,599 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:21:41,599 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 16) no Hoare annotation was computed. [2020-06-22 10:21:41,599 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:21:41,599 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 16) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) [2020-06-22 10:21:41,600 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 16) no Hoare annotation was computed. [2020-06-22 10:21:41,600 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:21:41,600 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:21:41,600 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:21:41,600 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:21:41,600 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:21:41,600 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:21:41,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:21:41,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:21:41,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:21:41,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:21:41,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:21:41,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:21:41,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:21:41,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:21:41,602 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:21:41,602 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 10:21:41,602 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:21:41,602 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 10:21:41,602 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:21:41,602 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:21:41,602 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 10:21:41,602 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:21:41,602 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 10:21:41,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:21:41,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:21:41,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:21:41,603 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:21:41,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:41,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:41,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:41,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:41,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:41,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:41,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:21:41 BasicIcfg [2020-06-22 10:21:41,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:21:41,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:21:41,623 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:21:41,626 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:21:41,627 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:41,627 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:21:39" (1/5) ... [2020-06-22 10:21:41,627 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74707ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:21:41, skipping insertion in model container [2020-06-22 10:21:41,627 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:41,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:39" (2/5) ... [2020-06-22 10:21:41,628 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74707ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:21:41, skipping insertion in model container [2020-06-22 10:21:41,628 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:41,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:21:39" (3/5) ... [2020-06-22 10:21:41,628 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74707ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:21:41, skipping insertion in model container [2020-06-22 10:21:41,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:41,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:21:40" (4/5) ... [2020-06-22 10:21:41,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74707ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:21:41, skipping insertion in model container [2020-06-22 10:21:41,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:41,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:21:41" (5/5) ... [2020-06-22 10:21:41,631 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:21:41,655 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:21:41,655 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:21:41,655 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:21:41,655 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:21:41,655 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:21:41,655 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:21:41,656 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:21:41,656 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:21:41,656 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:21:41,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-06-22 10:21:41,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:21:41,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:21:41,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:21:41,669 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:21:41,669 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:21:41,669 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:21:41,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-06-22 10:21:41,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:21:41,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:21:41,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:21:41,672 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:21:41,672 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:21:41,677 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [81] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [123] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet8_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret10=|v_ULTIMATE.start_main_#t~ret10_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret10, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 10#L10true [57] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 24#L10-1true [74] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 30#L11true [82] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 27#L13-3true [2020-06-22 10:21:41,678 INFO L796 eck$LassoCheckResult]: Loop: 27#L13-3true [78] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 34#L13true [87] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 32#L13-1true [86] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 17#L14true [66] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 15#L14-1true [165] L14-1-->L15: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (= (store |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem5_6| 1))) |v_#memory_int_17|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_17|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, #memory_int] 19#L15true [69] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 35#L15-1true [169] L15-1-->L13-3: Formula: (and (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (store |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| 1))) |v_#memory_int_22|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_30|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 27#L13-3true [2020-06-22 10:21:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:41,679 INFO L82 PathProgramCache]: Analyzing trace with hash 107155798, now seen corresponding path program 1 times [2020-06-22 10:21:41,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:41,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:41,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:41,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:41,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash 525939443, now seen corresponding path program 1 times [2020-06-22 10:21:41,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:41,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:41,749 INFO L82 PathProgramCache]: Analyzing trace with hash 626321406, now seen corresponding path program 1 times [2020-06-22 10:21:41,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:41,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:41,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:42,242 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2020-06-22 10:21:42,355 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-06-22 10:21:42,369 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:21:42,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:21:42,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:21:42,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:21:42,371 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:21:42,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:21:42,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:21:42,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:21:42,372 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:21:42,372 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:21:42,372 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:21:42,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,723 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2020-06-22 10:21:42,838 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2020-06-22 10:21:42,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:42,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:43,247 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:21:43,252 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:21:43,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:21:43,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:21:43,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:21:43,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:21:43,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:21:43,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:21:43,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:43,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:43,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:43,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:43,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:43,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:43,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:43,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:43,369 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:21:43,381 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:21:43,382 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:21:43,384 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:21:43,386 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:21:43,386 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:21:43,386 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2020-06-22 10:21:43,469 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:21:43,474 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:21:43,474 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:21:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:43,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:21:43,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:21:43,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:21:43,583 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:21:43,583 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:21:43,597 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:21:43,598 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:21:43,598 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2020-06-22 10:21:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:43,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:21:43,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:21:43,765 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:21:43,766 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 [2020-06-22 10:21:43,777 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:21:43,813 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size [2020-06-22 10:21:43,814 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:21:43,815 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 [2020-06-22 10:21:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:44,026 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:21:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:44,034 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:21:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:44,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:21:44,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:21:44,107 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:21:44,107 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 [2020-06-22 10:21:44,122 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:21:44,184 INFO L497 ElimStorePlain]: treesize reduction 85, result has 38.4 percent of original size [2020-06-22 10:21:44,186 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:21:44,186 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2020-06-22 10:21:53,290 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification that was a NOOP. DAG size: 31 [2020-06-22 10:21:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:53,373 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:21:53,374 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 10:21:53,377 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 13 loop predicates [2020-06-22 10:21:53,378 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states. Second operand 9 states. [2020-06-22 10:21:58,903 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states.. Second operand 9 states. Result 144 states and 245 transitions. Complement of second has 43 states. [2020-06-22 10:21:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 3 stem states 9 non-accepting loop states 2 accepting loop states [2020-06-22 10:21:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 10:21:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 165 transitions. [2020-06-22 10:21:58,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 5 letters. Loop has 7 letters. [2020-06-22 10:21:58,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:21:58,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 12 letters. Loop has 7 letters. [2020-06-22 10:21:58,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:21:58,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 5 letters. Loop has 14 letters. [2020-06-22 10:21:58,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:21:58,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 245 transitions. [2020-06-22 10:21:58,926 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:21:58,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 0 states and 0 transitions. [2020-06-22 10:21:58,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:21:58,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:21:58,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:21:58,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:21:58,928 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:21:58,929 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:21:58,929 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:21:58,929 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:21:58,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:21:58,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:21:58,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:21:58,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:21:58 BasicIcfg [2020-06-22 10:21:58,935 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:21:58,935 INFO L168 Benchmark]: Toolchain (without parser) took 19743.25 ms. Allocated memory was 514.9 MB in the beginning and 634.9 MB in the end (delta: 120.1 MB). Free memory was 439.4 MB in the beginning and 443.8 MB in the end (delta: -4.4 MB). Peak memory consumption was 115.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:58,936 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 462.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:21:58,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.10 ms. Allocated memory was 514.9 MB in the beginning and 555.7 MB in the end (delta: 40.9 MB). Free memory was 439.4 MB in the beginning and 524.2 MB in the end (delta: -84.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:58,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 555.7 MB. Free memory was 524.2 MB in the beginning and 522.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:58,938 INFO L168 Benchmark]: Boogie Preprocessor took 23.85 ms. Allocated memory is still 555.7 MB. Free memory was 522.0 MB in the beginning and 520.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:58,938 INFO L168 Benchmark]: RCFGBuilder took 420.43 ms. Allocated memory is still 555.7 MB. Free memory was 520.9 MB in the beginning and 500.3 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:58,939 INFO L168 Benchmark]: BlockEncodingV2 took 127.49 ms. Allocated memory is still 555.7 MB. Free memory was 500.3 MB in the beginning and 490.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:58,939 INFO L168 Benchmark]: TraceAbstraction took 1523.59 ms. Allocated memory was 555.7 MB in the beginning and 584.6 MB in the end (delta: 28.8 MB). Free memory was 489.5 MB in the beginning and 474.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 43.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:58,940 INFO L168 Benchmark]: BuchiAutomizer took 17312.24 ms. Allocated memory was 584.6 MB in the beginning and 634.9 MB in the end (delta: 50.3 MB). Free memory was 474.7 MB in the beginning and 443.8 MB in the end (delta: 30.9 MB). Peak memory consumption was 81.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:58,944 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 40 locations, 41 edges - StatisticsResult: Encoded RCFG 33 locations, 60 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 462.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 289.10 ms. Allocated memory was 514.9 MB in the beginning and 555.7 MB in the end (delta: 40.9 MB). Free memory was 439.4 MB in the beginning and 524.2 MB in the end (delta: -84.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 555.7 MB. Free memory was 524.2 MB in the beginning and 522.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.85 ms. Allocated memory is still 555.7 MB. Free memory was 522.0 MB in the beginning and 520.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 420.43 ms. Allocated memory is still 555.7 MB. Free memory was 520.9 MB in the beginning and 500.3 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 127.49 ms. Allocated memory is still 555.7 MB. Free memory was 500.3 MB in the beginning and 490.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1523.59 ms. Allocated memory was 555.7 MB in the beginning and 584.6 MB in the end (delta: 28.8 MB). Free memory was 489.5 MB in the beginning and 474.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 43.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 17312.24 ms. Allocated memory was 584.6 MB in the beginning and 634.9 MB in the end (delta: 50.3 MB). Free memory was 474.7 MB in the beginning and 443.8 MB in the end (delta: 30.9 MB). Peak memory consumption was 81.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-22 10:21:58,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:58,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:58,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:58,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:58,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:58,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 20 error locations. SAFE Result, 1.4s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 264 SDslu, 6 SDs, 0 SdLazy, 321 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.3s. Büchi inclusion checks took 15.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 6 SDtfs, 446 SDslu, 52 SDs, 0 SdLazy, 544 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax100 hnf100 lsp98 ukn60 mio100 lsp37 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:21:35.965 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:21:59.181 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check