NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:14:24,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:14:24,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:14:24,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:14:24,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:14:24,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:14:24,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:14:24,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:14:24,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:14:24,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:14:24,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:14:24,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:14:24,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:14:24,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:14:24,073 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:14:24,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:14:24,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:14:24,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:14:24,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:14:24,079 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:14:24,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:14:24,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:14:24,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:14:24,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:14:24,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:14:24,085 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:14:24,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:14:24,086 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:14:24,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:14:24,087 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:14:24,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:14:24,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:14:24,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:14:24,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:14:24,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:14:24,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:14:24,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:14:24,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:14:24,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:14:24,092 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:14:24,106 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:14:24,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:14:24,107 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:14:24,108 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:14:24,108 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:14:24,108 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:14:24,108 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:14:24,108 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:14:24,108 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:14:24,109 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:14:24,109 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:14:24,109 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:14:24,109 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:14:24,109 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:14:24,109 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:14:24,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:14:24,110 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:14:24,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:14:24,110 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:14:24,110 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:14:24,110 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:14:24,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:14:24,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:14:24,111 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:14:24,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:14:24,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:14:24,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:14:24,112 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:14:24,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:14:24,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:14:24,149 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:14:24,153 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:14:24,154 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:14:24,155 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:14:24,155 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:14:24,221 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8cee912ab18f4a39bd40851b070b7bd8/FLAG21bfe34d4 [2020-06-22 10:14:24,553 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:14:24,554 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:14:24,554 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:14:24,560 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8cee912ab18f4a39bd40851b070b7bd8/FLAG21bfe34d4 [2020-06-22 10:14:24,959 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8cee912ab18f4a39bd40851b070b7bd8 [2020-06-22 10:14:24,970 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:14:24,972 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:14:24,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:14:24,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:14:24,977 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:14:24,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:14:24" (1/1) ... [2020-06-22 10:14:24,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d61e5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:24, skipping insertion in model container [2020-06-22 10:14:24,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:14:24" (1/1) ... [2020-06-22 10:14:24,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:14:25,006 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:14:25,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:14:25,244 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:14:25,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:14:25,280 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:14:25,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25 WrapperNode [2020-06-22 10:14:25,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:14:25,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:14:25,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:14:25,282 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:14:25,292 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:14:25" (1/1) ... [2020-06-22 10:14:25,302 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:14:25" (1/1) ... [2020-06-22 10:14:25,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:14:25,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:14:25,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:14:25,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:14:25,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:14:25,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:14:25,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:14:25,351 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:14:25,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (1/1) ... No working directory specified, using /export/starexec/sandbox/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:14:25,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:14:25,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:14:25,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:14:25,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:14:25,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:14:25,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:14:25,759 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:14:25,759 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:14:25,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:14:25 BoogieIcfgContainer [2020-06-22 10:14:25,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:14:25,762 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:14:25,762 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:14:25,764 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:14:25,765 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:14:25" (1/1) ... [2020-06-22 10:14:25,783 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 55 edges [2020-06-22 10:14:25,785 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:14:25,785 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:14:25,786 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:14:25,786 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:14:25,788 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:14:25,789 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:14:25,789 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:14:25,816 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:14:25,850 INFO L200 BlockEncoder]: SBE split 29 edges [2020-06-22 10:14:25,855 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:14:25,857 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:14:25,895 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 10:14:25,897 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 10:14:25,899 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:14:25,899 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:14:25,900 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:14:25,900 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:14:25,901 INFO L313 BlockEncoder]: Encoded RCFG 43 locations, 74 edges [2020-06-22 10:14:25,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:14:25 BasicIcfg [2020-06-22 10:14:25,901 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:14:25,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:14:25,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:14:25,906 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:14:25,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:14:24" (1/4) ... [2020-06-22 10:14:25,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c78dcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:14:25, skipping insertion in model container [2020-06-22 10:14:25,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (2/4) ... [2020-06-22 10:14:25,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c78dcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:14:25, skipping insertion in model container [2020-06-22 10:14:25,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:14:25" (3/4) ... [2020-06-22 10:14:25,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c78dcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:14:25, skipping insertion in model container [2020-06-22 10:14:25,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:14:25" (4/4) ... [2020-06-22 10:14:25,910 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:14:25,920 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:14:25,928 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-06-22 10:14:25,945 INFO L257 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-06-22 10:14:25,974 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:14:25,974 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:14:25,975 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:14:25,975 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:14:25,975 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:14:25,975 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:14:25,975 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:14:25,975 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:14:25,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:14:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-06-22 10:14:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:14:25,997 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:25,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:14:25,998 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,003 INFO L82 PathProgramCache]: Analyzing trace with hash 246337, now seen corresponding path program 1 times [2020-06-22 10:14:26,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,184 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:14:26,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,208 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-06-22 10:14:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,376 INFO L93 Difference]: Finished difference Result 43 states and 74 transitions. [2020-06-22 10:14:26,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:14:26,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,392 INFO L225 Difference]: With dead ends: 43 [2020-06-22 10:14:26,392 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 10:14:26,395 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:14:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 10:14:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-06-22 10:14:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 10:14:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2020-06-22 10:14:26,436 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 3 [2020-06-22 10:14:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,437 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2020-06-22 10:14:26,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2020-06-22 10:14:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:14:26,438 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:14:26,438 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,439 INFO L82 PathProgramCache]: Analyzing trace with hash 246339, now seen corresponding path program 1 times [2020-06-22 10:14:26,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,474 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:14:26,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,478 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2020-06-22 10:14:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,560 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2020-06-22 10:14:26,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:14:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,562 INFO L225 Difference]: With dead ends: 43 [2020-06-22 10:14:26,562 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 10:14:26,563 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:14:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 10:14:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-06-22 10:14:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 10:14:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-06-22 10:14:26,568 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 3 [2020-06-22 10:14:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,569 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-06-22 10:14:26,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-06-22 10:14:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:14:26,570 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:14:26,570 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash 246340, now seen corresponding path program 1 times [2020-06-22 10:14:26,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,609 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:14:26,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,611 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 3 states. [2020-06-22 10:14:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,691 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. [2020-06-22 10:14:26,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:14:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,692 INFO L225 Difference]: With dead ends: 36 [2020-06-22 10:14:26,693 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 10:14:26,693 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:14:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 10:14:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 10:14:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:14:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2020-06-22 10:14:26,697 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 3 [2020-06-22 10:14:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,697 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2020-06-22 10:14:26,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2020-06-22 10:14:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:14:26,698 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:14:26,698 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,699 INFO L82 PathProgramCache]: Analyzing trace with hash 7634199, now seen corresponding path program 1 times [2020-06-22 10:14:26,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,726 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:14:26,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,727 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 3 states. [2020-06-22 10:14:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,802 INFO L93 Difference]: Finished difference Result 28 states and 45 transitions. [2020-06-22 10:14:26,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:14:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,803 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:14:26,803 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 10:14:26,804 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:14:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 10:14:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 10:14:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 10:14:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2020-06-22 10:14:26,808 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 4 [2020-06-22 10:14:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,808 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-06-22 10:14:26,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2020-06-22 10:14:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:14:26,809 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:14:26,809 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash 7634201, now seen corresponding path program 1 times [2020-06-22 10:14:26,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,836 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:14:26,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,837 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 3 states. [2020-06-22 10:14:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,894 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-06-22 10:14:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:14:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,896 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:14:26,896 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 10:14:26,896 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:14:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 10:14:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 10:14:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 10:14:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-06-22 10:14:26,900 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 4 [2020-06-22 10:14:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,900 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-06-22 10:14:26,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-06-22 10:14:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:14:26,900 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:14:26,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:14:26,901 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 10:14:26,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:26,901 INFO L82 PathProgramCache]: Analyzing trace with hash 7634202, now seen corresponding path program 1 times [2020-06-22 10:14:26,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:26,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:26,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:26,932 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:14:26,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:26,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:14:26,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:14:26,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:14:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:14:26,934 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2020-06-22 10:14:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:26,995 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-06-22 10:14:26,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:14:26,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:14:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:14:26,996 INFO L225 Difference]: With dead ends: 22 [2020-06-22 10:14:26,996 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:14:26,997 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:14:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:14:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:14:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:14:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:14:26,998 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 10:14:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:14:26,998 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:14:26,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:14:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:14:26,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:14:27,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:14:27,031 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 10:14:27,031 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 10:14:27,031 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-06-22 10:14:27,032 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:14:27,032 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 17) no Hoare annotation was computed. [2020-06-22 10:14:27,032 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 17) no Hoare annotation was computed. [2020-06-22 10:14:27,032 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:14:27,032 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:14:27,032 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:14:27,032 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:14:27,032 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:27,033 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-06-22 10:14:27,033 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:14:27,033 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:14:27,033 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:14:27,033 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:14:27,033 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:14:27,033 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:14:27,033 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-06-22 10:14:27,034 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 16) no Hoare annotation was computed. [2020-06-22 10:14:27,034 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2020-06-22 10:14:27,034 INFO L444 ceAbstractionStarter]: At program point L12-4(lines 9 17) the Hoare annotation is: (and (= 0 ULTIMATE.start_gcd_~y2_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_gcd_~y2_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_gcd_~y2_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_gcd_~y1_ref~0.base)) (= 0 ULTIMATE.start_gcd_~y1_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_gcd_~y1_ref~0.base))) [2020-06-22 10:14:27,034 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:27,034 INFO L448 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-06-22 10:14:27,035 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:27,035 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:14:27,035 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:14:27,035 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:14:27,035 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 10:14:27,035 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-06-22 10:14:27,035 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:14:27,035 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:14:27,035 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:14:27,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:27,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:14:27,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:14:27,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:14:27,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:14:27,037 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:14:27,037 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:27,037 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:14:27,037 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:14:27,037 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:14:27,038 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:14:27,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:27,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:27,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:27,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:27,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:14:27 BasicIcfg [2020-06-22 10:14:27,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:14:27,057 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:14:27,057 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:14:27,061 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:14:27,062 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:27,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:14:24" (1/5) ... [2020-06-22 10:14:27,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cf8aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:14:27, skipping insertion in model container [2020-06-22 10:14:27,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:27,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:14:25" (2/5) ... [2020-06-22 10:14:27,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cf8aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:14:27, skipping insertion in model container [2020-06-22 10:14:27,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:27,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:14:25" (3/5) ... [2020-06-22 10:14:27,064 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cf8aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:14:27, skipping insertion in model container [2020-06-22 10:14:27,064 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:27,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:14:25" (4/5) ... [2020-06-22 10:14:27,065 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cf8aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:14:27, skipping insertion in model container [2020-06-22 10:14:27,065 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:14:27,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:14:27" (5/5) ... [2020-06-22 10:14:27,068 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:14:27,089 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:14:27,089 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:14:27,089 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:14:27,089 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:14:27,089 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:14:27,089 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:14:27,089 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:14:27,090 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:14:27,090 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:14:27,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-06-22 10:14:27,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:27,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:27,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:27,104 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:14:27,104 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:27,104 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:14:27,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-06-22 10:14:27,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 10:14:27,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:27,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:27,108 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:14:27,108 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:27,113 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [220] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_36| 0 0) |v_#valid_35|)) InVars {#valid=|v_#valid_36|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6, #valid=|v_#valid_35|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0, #valid, #NULL.offset, #NULL.base] 43#L24true [163] L24-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_gcd_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_gcd_~y2_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (<= 0 v_ULTIMATE.start_main_~y2~0_4) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1)) (= v_ULTIMATE.start_gcd_~y2_1 |v_ULTIMATE.start_gcd_#in~y2_1|) (= v_ULTIMATE.start_gcd_~y1_1 |v_ULTIMATE.start_gcd_#in~y1_1|) (<= 0 v_ULTIMATE.start_main_~y1~0_4) (= v_ULTIMATE.start_gcd_~y1_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_gcd_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_gcd_#in~y1_1| v_ULTIMATE.start_main_~y1~0_4) (= v_ULTIMATE.start_gcd_~y1_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) 0) (= (store (store |v_#length_3| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_gcd_~y2_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2_1| v_ULTIMATE.start_main_~y2~0_4) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_4, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_4, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_1, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_1, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_1|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_1|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_1, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_4, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_1, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_4, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_~y1_ref~0.offset, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_~y2_ref~0.base, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_~y1_ref~0.base, ULTIMATE.start_gcd_#t~mem2, #valid, #length, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~y2_ref~0.offset] 27#L8true [88] L8-->L8-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_3) (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_gcd_~y1_ref~0.base_3)) (= 1 (select |v_#valid_6| v_ULTIMATE.start_gcd_~y1_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~y1_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~y1_ref~0.base_3) v_ULTIMATE.start_gcd_~y1_ref~0.offset_3 v_ULTIMATE.start_gcd_~y1_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_3, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_3, #length=|v_#length_4|} OutVars{ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_3, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_3, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 25#L8-1true [85] L8-1-->L12-4: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_3) (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_gcd_~y2_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_gcd_~y2_ref~0.base_3) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y2_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y2_ref~0.base_3) v_ULTIMATE.start_gcd_~y2_ref~0.offset_3 v_ULTIMATE.start_gcd_~y2_3)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_3, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_3} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_3, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 28#L12-4true [2020-06-22 10:14:27,114 INFO L796 eck$LassoCheckResult]: Loop: 28#L12-4true [92] L12-4-->L11: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_gcd_~y1_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~y1_ref~0.base_6) v_ULTIMATE.start_gcd_~y1_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_gcd_~y1_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_6, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_5, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 35#L11true [98] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_gcd_~y2_ref~0.base_6)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_gcd_~y2_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_gcd_~y2_ref~0.base_6) v_ULTIMATE.start_gcd_~y2_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_6, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_6, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 31#L11-1true [186] L11-1-->L12: Formula: (< |v_ULTIMATE.start_gcd_#t~mem3_6| |v_ULTIMATE.start_gcd_#t~mem2_6|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 17#L12true [114] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1_ref~0.base_9)) (= |v_ULTIMATE.start_gcd_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1_ref~0.base_9) v_ULTIMATE.start_gcd_~y1_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_7) (= (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_2|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_9, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_7, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem4] 15#L12-1true [111] L12-1-->L12-2: Formula: (and (= (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2_ref~0.base_9) 1) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2_ref~0.base_9) v_ULTIMATE.start_gcd_~y2_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2_ref~0.base_9)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_9, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_9, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 14#L12-2true [147] L12-2-->L15: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem5_6| |v_ULTIMATE.start_gcd_#t~mem4_6|) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_6|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4] 21#L15true [82] L15-->L15-1: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_gcd_~y2_ref~0.base_15) v_ULTIMATE.start_gcd_~y2_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_gcd_~y2_ref~0.base_15)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_gcd_~y2_ref~0.base_15)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_15, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_11, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_2|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem8] 44#L15-1true [105] L15-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_13 4) (select |v_#length_24| v_ULTIMATE.start_gcd_~y1_ref~0.base_18)) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_13) (= |v_ULTIMATE.start_gcd_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_gcd_~y1_ref~0.base_18) v_ULTIMATE.start_gcd_~y1_ref~0.offset_13)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_gcd_~y1_ref~0.base_18))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_13, #length=|v_#length_24|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_18, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_18, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_13, #length=|v_#length_24|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9] 42#L15-2true [226] L15-2-->L12-4: Formula: (and (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_gcd_~y2_ref~0.base_21 (store (select |v_#memory_int_23| v_ULTIMATE.start_gcd_~y2_ref~0.base_21) v_ULTIMATE.start_gcd_~y2_ref~0.offset_15 (+ |v_ULTIMATE.start_gcd_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_gcd_#t~mem9_6|))))) (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_15 4) (select |v_#length_33| v_ULTIMATE.start_gcd_~y2_ref~0.base_21)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_gcd_~y2_ref~0.base_21)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_15)) InVars {ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_21, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_33|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_6|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_6|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_15} OutVars{ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_21, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_33|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_5|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_5|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_15} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8] 28#L12-4true [2020-06-22 10:14:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,115 INFO L82 PathProgramCache]: Analyzing trace with hash 7636997, now seen corresponding path program 1 times [2020-06-22 10:14:27,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:27,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash 960777160, now seen corresponding path program 1 times [2020-06-22 10:14:27,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:14:27,229 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:14:27,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:14:27,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 10:14:27,230 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:14:27,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:14:27,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:14:27,232 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 7 states. [2020-06-22 10:14:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:14:27,561 INFO L93 Difference]: Finished difference Result 59 states and 100 transitions. [2020-06-22 10:14:27,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:14:27,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 100 transitions. [2020-06-22 10:14:27,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 10:14:27,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 22 states and 27 transitions. [2020-06-22 10:14:27,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 10:14:27,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 10:14:27,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2020-06-22 10:14:27,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:14:27,571 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-06-22 10:14:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2020-06-22 10:14:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2020-06-22 10:14:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:14:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-06-22 10:14:27,574 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-06-22 10:14:27,575 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-06-22 10:14:27,575 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:14:27,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-06-22 10:14:27,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 10:14:27,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:14:27,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:14:27,576 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:14:27,576 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:14:27,577 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY [220] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_36| 0 0) |v_#valid_35|)) InVars {#valid=|v_#valid_36|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6, #valid=|v_#valid_35|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0, #valid, #NULL.offset, #NULL.base] 131#L24 [163] L24-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_gcd_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_gcd_~y2_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (<= 0 v_ULTIMATE.start_main_~y2~0_4) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1)) (= v_ULTIMATE.start_gcd_~y2_1 |v_ULTIMATE.start_gcd_#in~y2_1|) (= v_ULTIMATE.start_gcd_~y1_1 |v_ULTIMATE.start_gcd_#in~y1_1|) (<= 0 v_ULTIMATE.start_main_~y1~0_4) (= v_ULTIMATE.start_gcd_~y1_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_gcd_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_gcd_#in~y1_1| v_ULTIMATE.start_main_~y1~0_4) (= v_ULTIMATE.start_gcd_~y1_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) 0) (= (store (store |v_#length_3| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_gcd_~y2_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2_1| v_ULTIMATE.start_main_~y2~0_4) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_4, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_4, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_1, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_1, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_1|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_1|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_1, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_4, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_1, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_4, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_~y1_ref~0.offset, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_~y2_ref~0.base, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_~y1_ref~0.base, ULTIMATE.start_gcd_#t~mem2, #valid, #length, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~y2_ref~0.offset] 123#L8 [88] L8-->L8-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_3) (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_gcd_~y1_ref~0.base_3)) (= 1 (select |v_#valid_6| v_ULTIMATE.start_gcd_~y1_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~y1_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~y1_ref~0.base_3) v_ULTIMATE.start_gcd_~y1_ref~0.offset_3 v_ULTIMATE.start_gcd_~y1_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_3, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_3, #length=|v_#length_4|} OutVars{ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_3, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_3, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 121#L8-1 [85] L8-1-->L12-4: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_3) (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_gcd_~y2_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_gcd_~y2_ref~0.base_3) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y2_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y2_ref~0.base_3) v_ULTIMATE.start_gcd_~y2_ref~0.offset_3 v_ULTIMATE.start_gcd_~y2_3)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_3, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_3} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_3, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 122#L12-4 [2020-06-22 10:14:27,577 INFO L796 eck$LassoCheckResult]: Loop: 122#L12-4 [92] L12-4-->L11: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_gcd_~y1_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~y1_ref~0.base_6) v_ULTIMATE.start_gcd_~y1_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_gcd_~y1_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_6, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_5, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 124#L11 [98] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_gcd_~y2_ref~0.base_6)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_gcd_~y2_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_gcd_~y2_ref~0.base_6) v_ULTIMATE.start_gcd_~y2_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_6, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_6, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 125#L11-1 [186] L11-1-->L12: Formula: (< |v_ULTIMATE.start_gcd_#t~mem3_6| |v_ULTIMATE.start_gcd_#t~mem2_6|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 126#L12 [114] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1_ref~0.base_9)) (= |v_ULTIMATE.start_gcd_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1_ref~0.base_9) v_ULTIMATE.start_gcd_~y1_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_7) (= (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_2|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_9, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_7, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem4] 133#L12-1 [111] L12-1-->L12-2: Formula: (and (= (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2_ref~0.base_9) 1) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2_ref~0.base_9) v_ULTIMATE.start_gcd_~y2_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2_ref~0.base_9)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_9, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_9, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 128#L12-2 [109] L12-2-->L13: Formula: (< |v_ULTIMATE.start_gcd_#t~mem5_4| |v_ULTIMATE.start_gcd_#t~mem4_4|) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_4|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_4|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_3|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4] 129#L13 [125] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_gcd_~y1_ref~0.base_12)) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_9) (= |v_ULTIMATE.start_gcd_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y1_ref~0.base_12) v_ULTIMATE.start_gcd_~y1_ref~0.offset_9)) (= (select |v_#valid_18| v_ULTIMATE.start_gcd_~y1_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_12, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_2|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_12, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_9, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem6] 134#L13-1 [122] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y2_ref~0.base_12) v_ULTIMATE.start_gcd_~y2_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_9 4) (select |v_#length_18| v_ULTIMATE.start_gcd_~y2_ref~0.base_12)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_9) (= 1 (select |v_#valid_20| v_ULTIMATE.start_gcd_~y2_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_18|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_12, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_9, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_12, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 132#L13-2 [225] L13-2-->L12-4: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_19 4) (select |v_#length_32| v_ULTIMATE.start_gcd_~y1_ref~0.base_26)) (= (store |v_#memory_int_21| v_ULTIMATE.start_gcd_~y1_ref~0.base_26 (store (select |v_#memory_int_21| v_ULTIMATE.start_gcd_~y1_ref~0.base_26) v_ULTIMATE.start_gcd_~y1_ref~0.offset_19 (+ |v_ULTIMATE.start_gcd_#t~mem6_6| (* (- 1) |v_ULTIMATE.start_gcd_#t~mem7_6|)))) |v_#memory_int_20|) (= (select |v_#valid_41| v_ULTIMATE.start_gcd_~y1_ref~0.base_26) 1) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_19)) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_6|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_26, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_19, #length=|v_#length_32|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_5|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_26, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_19, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, #memory_int] 122#L12-4 [2020-06-22 10:14:27,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash 7636997, now seen corresponding path program 2 times [2020-06-22 10:14:27,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:27,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash 959686951, now seen corresponding path program 1 times [2020-06-22 10:14:27,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:14:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:14:27,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1350428067, now seen corresponding path program 1 times [2020-06-22 10:14:27,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:14:27,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:14:27,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:14:27,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:14:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:14:27,970 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2020-06-22 10:14:28,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:14:28 BasicIcfg [2020-06-22 10:14:28,085 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:14:28,086 INFO L168 Benchmark]: Toolchain (without parser) took 3115.05 ms. Allocated memory was 649.6 MB in the beginning and 758.6 MB in the end (delta: 109.1 MB). Free memory was 564.1 MB in the beginning and 673.7 MB in the end (delta: -109.6 MB). Peak memory consumption was 222.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:28,087 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:14:28,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.05 ms. Allocated memory was 649.6 MB in the beginning and 698.4 MB in the end (delta: 48.8 MB). Free memory was 564.1 MB in the beginning and 661.9 MB in the end (delta: -97.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:28,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.55 ms. Allocated memory is still 698.4 MB. Free memory was 661.9 MB in the beginning and 659.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:28,089 INFO L168 Benchmark]: Boogie Preprocessor took 24.48 ms. Allocated memory is still 698.4 MB. Free memory was 659.2 MB in the beginning and 657.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:28,089 INFO L168 Benchmark]: RCFGBuilder took 410.60 ms. Allocated memory is still 698.4 MB. Free memory was 657.8 MB in the beginning and 632.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:28,090 INFO L168 Benchmark]: BlockEncodingV2 took 139.88 ms. Allocated memory is still 698.4 MB. Free memory was 632.7 MB in the beginning and 623.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:28,091 INFO L168 Benchmark]: TraceAbstraction took 1154.06 ms. Allocated memory is still 698.4 MB. Free memory was 622.0 MB in the beginning and 502.5 MB in the end (delta: 119.4 MB). Peak memory consumption was 119.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:28,091 INFO L168 Benchmark]: BuchiAutomizer took 1028.43 ms. Allocated memory was 698.4 MB in the beginning and 758.6 MB in the end (delta: 60.3 MB). Free memory was 502.5 MB in the beginning and 673.7 MB in the end (delta: -171.1 MB). Peak memory consumption was 112.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:14:28,096 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 52 locations, 55 edges - StatisticsResult: Encoded RCFG 43 locations, 74 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 308.05 ms. Allocated memory was 649.6 MB in the beginning and 698.4 MB in the end (delta: 48.8 MB). Free memory was 564.1 MB in the beginning and 661.9 MB in the end (delta: -97.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.55 ms. Allocated memory is still 698.4 MB. Free memory was 661.9 MB in the beginning and 659.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.48 ms. Allocated memory is still 698.4 MB. Free memory was 659.2 MB in the beginning and 657.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 410.60 ms. Allocated memory is still 698.4 MB. Free memory was 657.8 MB in the beginning and 632.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 139.88 ms. Allocated memory is still 698.4 MB. Free memory was 632.7 MB in the beginning and 623.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1154.06 ms. Allocated memory is still 698.4 MB. Free memory was 622.0 MB in the beginning and 502.5 MB in the end (delta: 119.4 MB). Peak memory consumption was 119.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1028.43 ms. Allocated memory was 698.4 MB in the beginning and 758.6 MB in the end (delta: 60.3 MB). Free memory was 502.5 MB in the beginning and 673.7 MB in the end (delta: -171.1 MB). Peak memory consumption was 112.6 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: 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: 18]: 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: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: 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: 9]: 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: 12]: 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: 12]: 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: 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: 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: 12]: 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: 8]: 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: 15]: 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 - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-06-22 10:14:28,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:28,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:28,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:14:28,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((0 == y2_ref && 4 == unknown-#length-unknown[y2_ref]) && 1 == \valid[y2_ref]) && 4 == unknown-#length-unknown[y1_ref]) && 0 == y1_ref) && 1 == \valid[y1_ref] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 26 error locations. SAFE Result, 1.0s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 207 SDslu, 4 SDs, 0 SdLazy, 215 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 7 SDtfs, 34 SDslu, 73 SDs, 0 SdLazy, 350 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 11]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=8684} State at position 1 is {y2=0, y1=2021, \old(y1)=2021, NULL=0, \result=0, y2_ref=8683, NULL=8684, y2=0, \result=0, y1=2021, y1_ref=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f475f5c=0, y1_ref=8682, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24ba1dd2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@1cd42b3e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f1af5b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@25ee5e7c=0, y2_ref=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@617c6ccd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@65fb46aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@619c719=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@8a5487b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@702e50b6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@325d45ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@7edca7d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@132ee472=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@45f7be3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@617c6ccd=8683, NULL=0, \old(y2)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24ba1dd2=8682} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L22] int y1 = __VERIFIER_nondet_int(); [L23] int y2 = __VERIFIER_nondet_int(); [L24] COND TRUE y1 >= 0 && y2 >= 0 [L6] int* y1_ref = alloca(sizeof(int)); [L7] int* y2_ref = alloca(sizeof(int)); [L8] *y1_ref = y1 [L9] *y2_ref = y2 Loop: [L11] EXPR \read(*y1_ref) [L11] EXPR \read(*y2_ref) [L11] COND TRUE *y1_ref != *y2_ref [L12] EXPR \read(*y1_ref) [L12] EXPR \read(*y2_ref) [L12] COND TRUE *y1_ref > *y2_ref [L13] EXPR \read(*y1_ref) [L13] EXPR \read(*y2_ref) [L13] *y1_ref = *y1_ref - *y2_ref End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 10:14:21.774 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:14:28.343 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check