YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-21 22:55:55,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-21 22:55:55,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-21 22:55:55,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-21 22:55:55,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-21 22:55:55,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-21 22:55:55,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-21 22:55:55,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-21 22:55:55,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-21 22:55:55,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-21 22:55:55,199 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-21 22:55:55,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-21 22:55:55,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-21 22:55:55,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-21 22:55:55,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-21 22:55:55,203 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-21 22:55:55,204 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-21 22:55:55,205 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-21 22:55:55,207 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-21 22:55:55,209 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-21 22:55:55,210 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-21 22:55:55,211 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-21 22:55:55,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-21 22:55:55,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-21 22:55:55,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-21 22:55:55,214 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-21 22:55:55,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-21 22:55:55,215 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-21 22:55:55,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-21 22:55:55,216 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-21 22:55:55,217 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-21 22:55:55,217 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-21 22:55:55,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-21 22:55:55,218 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-21 22:55:55,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-21 22:55:55,219 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-21 22:55:55,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-21 22:55:55,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-21 22:55:55,221 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-21 22:55:55,221 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-21 22:55:55,236 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-21 22:55:55,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-21 22:55:55,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-21 22:55:55,237 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-21 22:55:55,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-21 22:55:55,238 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-21 22:55:55,238 INFO L133 SettingsManager]: * Use SBE=true [2020-06-21 22:55:55,238 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-21 22:55:55,238 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-21 22:55:55,238 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-21 22:55:55,238 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-21 22:55:55,239 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-21 22:55:55,239 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-21 22:55:55,239 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-21 22:55:55,239 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:55:55,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-21 22:55:55,239 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-21 22:55:55,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-21 22:55:55,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-21 22:55:55,240 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-21 22:55:55,240 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-21 22:55:55,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-21 22:55:55,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-21 22:55:55,241 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-21 22:55:55,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-21 22:55:55,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-21 22:55:55,241 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-21 22:55:55,241 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-21 22:55:55,242 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-21 22:55:55,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-21 22:55:55,280 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-21 22:55:55,283 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-21 22:55:55,285 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-21 22:55:55,285 INFO L276 PluginConnector]: CDTParser initialized [2020-06-21 22:55:55,286 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-21 22:55:55,351 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/2461186eb30d4144b19f73a9655394b0/FLAG51ab2a7a8 [2020-06-21 22:55:55,686 INFO L307 CDTParser]: Found 1 translation units. [2020-06-21 22:55:55,686 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-21 22:55:55,693 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/2461186eb30d4144b19f73a9655394b0/FLAG51ab2a7a8 [2020-06-21 22:55:56,096 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/2461186eb30d4144b19f73a9655394b0 [2020-06-21 22:55:56,108 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-21 22:55:56,109 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-21 22:55:56,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-21 22:55:56,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-21 22:55:56,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-21 22:55:56,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431ea3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56, skipping insertion in model container [2020-06-21 22:55:56,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-21 22:55:56,144 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-21 22:55:56,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 22:55:56,310 INFO L191 MainTranslator]: Completed pre-run [2020-06-21 22:55:56,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 22:55:56,409 INFO L195 MainTranslator]: Completed translation [2020-06-21 22:55:56,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56 WrapperNode [2020-06-21 22:55:56,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-21 22:55:56,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-21 22:55:56,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-21 22:55:56,411 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-21 22:55:56,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-21 22:55:56,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-21 22:55:56,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-21 22:55:56,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-21 22:55:56,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-21 22:55:56,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-21 22:55:56,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-21 22:55:56,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-21 22:55:56,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (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-21 22:55:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-21 22:55:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-21 22:55:56,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-21 22:55:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-21 22:55:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-21 22:55:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-21 22:55:56,714 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-21 22:55:56,714 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-21 22:55:56,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:55:56 BoogieIcfgContainer [2020-06-21 22:55:56,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-21 22:55:56,716 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-21 22:55:56,716 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-21 22:55:56,719 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-21 22:55:56,719 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:55:56" (1/1) ... [2020-06-21 22:55:56,735 INFO L313 BlockEncoder]: Initial Icfg 17 locations, 18 edges [2020-06-21 22:55:56,737 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-21 22:55:56,738 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-21 22:55:56,738 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-21 22:55:56,739 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-21 22:55:56,741 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-21 22:55:56,741 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-21 22:55:56,742 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-21 22:55:56,759 INFO L185 BlockEncoder]: Using Use SBE [2020-06-21 22:55:56,777 INFO L200 BlockEncoder]: SBE split 7 edges [2020-06-21 22:55:56,782 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-21 22:55:56,784 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 22:55:56,805 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-21 22:55:56,807 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-21 22:55:56,809 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-21 22:55:56,809 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 22:55:56,815 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-21 22:55:56,816 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-21 22:55:56,816 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-21 22:55:56,816 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 22:55:56,817 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-21 22:55:56,817 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-21 22:55:56,818 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 18 edges [2020-06-21 22:55:56,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 10:55:56 BasicIcfg [2020-06-21 22:55:56,818 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-21 22:55:56,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-21 22:55:56,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-21 22:55:56,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-21 22:55:56,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 10:55:56" (1/4) ... [2020-06-21 22:55:56,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 10:55:56, skipping insertion in model container [2020-06-21 22:55:56,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (2/4) ... [2020-06-21 22:55:56,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 10:55:56, skipping insertion in model container [2020-06-21 22:55:56,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:55:56" (3/4) ... [2020-06-21 22:55:56,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 10:55:56, skipping insertion in model container [2020-06-21 22:55:56,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 10:55:56" (4/4) ... [2020-06-21 22:55:56,827 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 22:55:56,838 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-21 22:55:56,847 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-06-21 22:55:56,867 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-06-21 22:55:56,896 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 22:55:56,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-21 22:55:56,897 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-21 22:55:56,897 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 22:55:56,897 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 22:55:56,897 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 22:55:56,897 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-21 22:55:56,898 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 22:55:56,898 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-21 22:55:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-06-21 22:55:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-21 22:55:56,919 INFO L394 BasicCegarLoop]: Found error trace [2020-06-21 22:55:56,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-21 22:55:56,920 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-21 22:55:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash 66149, now seen corresponding path program 1 times [2020-06-21 22:55:56,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:55:56,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:55:56,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:56,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:55:56,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:55:57,079 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-21 22:55:57,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 22:55:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-21 22:55:57,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-21 22:55:57,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-21 22:55:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-21 22:55:57,105 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-06-21 22:55:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 22:55:57,170 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2020-06-21 22:55:57,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-21 22:55:57,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-21 22:55:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-21 22:55:57,183 INFO L225 Difference]: With dead ends: 11 [2020-06-21 22:55:57,184 INFO L226 Difference]: Without dead ends: 8 [2020-06-21 22:55:57,187 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-21 22:55:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-06-21 22:55:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-06-21 22:55:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-21 22:55:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-06-21 22:55:57,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 3 [2020-06-21 22:55:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-21 22:55:57,222 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-21 22:55:57,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-21 22:55:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2020-06-21 22:55:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-21 22:55:57,223 INFO L394 BasicCegarLoop]: Found error trace [2020-06-21 22:55:57,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-21 22:55:57,224 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-21 22:55:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash 66151, now seen corresponding path program 1 times [2020-06-21 22:55:57,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:55:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:55:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:57,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:55:57,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:55:57,251 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-21 22:55:57,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 22:55:57,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-21 22:55:57,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-21 22:55:57,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-21 22:55:57,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-21 22:55:57,254 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2020-06-21 22:55:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 22:55:57,289 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. [2020-06-21 22:55:57,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-21 22:55:57,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-21 22:55:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-21 22:55:57,290 INFO L225 Difference]: With dead ends: 8 [2020-06-21 22:55:57,291 INFO L226 Difference]: Without dead ends: 0 [2020-06-21 22:55:57,292 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-21 22:55:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-21 22:55:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-21 22:55:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-21 22:55:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-21 22:55:57,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2020-06-21 22:55:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-21 22:55:57,293 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:55:57,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-21 22:55:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-21 22:55:57,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-21 22:55:57,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-21 22:55:57,316 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-21 22:55:57,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-21 22:55:57,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-21 22:55:57,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-21 22:55:57,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-21 22:55:57,316 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-21 22:55:57,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-21 22:55:57,317 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-21 22:55:57,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-21 22:55:57,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-21 22:55:57,317 INFO L444 ceAbstractionStarter]: At program point L12-3(lines 12 14) the Hoare annotation is: (and (= |ULTIMATE.start_main_~#a~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_main_~#a~0.base|)) (= (select |#length| |ULTIMATE.start_main_~#a~0.base|) 4192)) [2020-06-21 22:55:57,318 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-21 22:55:57,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-21 22:55:57,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-21 22:55:57,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 10:55:57 BasicIcfg [2020-06-21 22:55:57,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-21 22:55:57,334 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-21 22:55:57,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-21 22:55:57,337 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-21 22:55:57,338 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:55:57,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.06 10:55:56" (1/5) ... [2020-06-21 22:55:57,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35dfb443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 10:55:57, skipping insertion in model container [2020-06-21 22:55:57,338 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:55:57,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:55:56" (2/5) ... [2020-06-21 22:55:57,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35dfb443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 10:55:57, skipping insertion in model container [2020-06-21 22:55:57,339 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:55:57,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:55:56" (3/5) ... [2020-06-21 22:55:57,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35dfb443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 10:55:57, skipping insertion in model container [2020-06-21 22:55:57,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:55:57,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 10:55:56" (4/5) ... [2020-06-21 22:55:57,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35dfb443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 10:55:57, skipping insertion in model container [2020-06-21 22:55:57,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:55:57,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 10:55:57" (5/5) ... [2020-06-21 22:55:57,342 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 22:55:57,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 22:55:57,362 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-21 22:55:57,363 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-21 22:55:57,363 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 22:55:57,363 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 22:55:57,363 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 22:55:57,363 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-21 22:55:57,363 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 22:55:57,363 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-21 22:55:57,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-21 22:55:57,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 22:55:57,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:55:57,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:55:57,376 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 22:55:57,376 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 22:55:57,376 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-21 22:55:57,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-21 22:55:57,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 22:55:57,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:55:57,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:55:57,378 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 22:55:57,378 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 22:55:57,383 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [36] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 3#L-1true [56] L-1-->L12-3: Formula: (and (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1|)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_1| 4192)) (< |v_ULTIMATE.start_main_~#a~0.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_1|) (> |v_ULTIMATE.start_main_~#a~0.base_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_1|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem0] 13#L12-3true [2020-06-21 22:55:57,384 INFO L796 eck$LassoCheckResult]: Loop: 13#L12-3true [73] L12-3-->L13: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 12))) (and (<= 0 .cse0) (<= 0 (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#a~0.base_22|) .cse0)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 16) (select |v_#length_10| |v_ULTIMATE.start_main_~#a~0.base_22|)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#a~0.base_22|) 1))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_13|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem0] 10#L13true [43] L13-->L13-1: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 12))) (and (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#a~0.base_7|) .cse0)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 16) (select |v_#length_5| |v_ULTIMATE.start_main_~#a~0.base_7|)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#a~0.base_7|) 1) (<= 0 .cse0))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, #length=|v_#length_5|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 8#L13-1true [71] L13-1-->L12-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 12))) (and (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 16) (select |v_#length_9| |v_ULTIMATE.start_main_~#a~0.base_19|)) (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#a~0.base_19|) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19|) .cse0 (+ |v_ULTIMATE.start_main_#t~mem1_6| (- 1))))) (<= 0 .cse0))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|, #length=|v_#length_9|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem1] 13#L12-3true [2020-06-21 22:55:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2133, now seen corresponding path program 1 times [2020-06-21 22:55:57,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:55:57,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:55:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:57,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:55:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 101348, now seen corresponding path program 1 times [2020-06-21 22:55:57,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:55:57,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:55:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:57,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:55:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:57,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:57,431 INFO L82 PathProgramCache]: Analyzing trace with hash 63615760, now seen corresponding path program 1 times [2020-06-21 22:55:57,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:55:57,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:55:57,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:57,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:55:57,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:57,570 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:55:57,572 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:55:57,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:55:57,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:55:57,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:55:57,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:55:57,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:55:57,573 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:55:57,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-21 22:55:57,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:55:57,573 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:55:57,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:57,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:57,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:57,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:57,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:57,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:57,791 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:55:57,796 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:55:57,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:57,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:57,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:55:57,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:57,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:57,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:57,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:55:57,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:55:57,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:57,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:57,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:57,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:55:57,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:57,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:57,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:57,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:55:57,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:55:57,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:57,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:57,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:57,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:57,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:57,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:57,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:55:57,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:55:57,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:57,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:57,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:57,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:57,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:57,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:57,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:55:57,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:55:57,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:57,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:57,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:57,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:57,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:57,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:57,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:55:57,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:55:57,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:57,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:57,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:57,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:57,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:57,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:57,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:55:57,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:55:57,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:57,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:57,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:57,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:57,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:57,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:57,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:55:57,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:55:57,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:57,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:57,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:57,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:55:57,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:57,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:57,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:57,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:55:57,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:55:57,869 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:55:57,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:55:57,874 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 22:55:57,876 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:55:57,876 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:55:57,876 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:55:57,877 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_1 + 1 Supporting invariants [] [2020-06-21 22:55:57,881 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-06-21 22:55:57,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-21 22:55:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:55:57,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:55:57,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:55:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:55:57,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-21 22:55:57,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:55:57,990 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-21 22:55:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:58,045 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 22:55:58,045 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-21 22:55:58,048 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-21 22:55:58,049 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 4 states. [2020-06-21 22:55:58,160 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 4 states. Result 29 states and 57 transitions. Complement of second has 8 states. [2020-06-21 22:55:58,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-21 22:55:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-21 22:55:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-06-21 22:55:58,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-21 22:55:58,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:55:58,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-21 22:55:58,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:55:58,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-21 22:55:58,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:55:58,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 57 transitions. [2020-06-21 22:55:58,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 22:55:58,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 5 states and 5 transitions. [2020-06-21 22:55:58,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-21 22:55:58,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-21 22:55:58,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5 transitions. [2020-06-21 22:55:58,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-21 22:55:58,178 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-06-21 22:55:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 5 transitions. [2020-06-21 22:55:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-06-21 22:55:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-21 22:55:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2020-06-21 22:55:58,180 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-06-21 22:55:58,180 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-06-21 22:55:58,181 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-21 22:55:58,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 5 transitions. [2020-06-21 22:55:58,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 22:55:58,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:55:58,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:55:58,182 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 22:55:58,182 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 22:55:58,182 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY [36] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 91#L-1 [55] L-1-->L12-3: Formula: (and (< |v_ULTIMATE.start_main_~#a~0.base_1| 0) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1|)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_1| 4192)) (< |v_ULTIMATE.start_main_~#a~0.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_1|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem0] 92#L12-3 [2020-06-21 22:55:58,183 INFO L796 eck$LassoCheckResult]: Loop: 92#L12-3 [73] L12-3-->L13: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 12))) (and (<= 0 .cse0) (<= 0 (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#a~0.base_22|) .cse0)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 16) (select |v_#length_10| |v_ULTIMATE.start_main_~#a~0.base_22|)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#a~0.base_22|) 1))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_13|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem0] 95#L13 [43] L13-->L13-1: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 12))) (and (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#a~0.base_7|) .cse0)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 16) (select |v_#length_5| |v_ULTIMATE.start_main_~#a~0.base_7|)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#a~0.base_7|) 1) (<= 0 .cse0))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, #length=|v_#length_5|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 94#L13-1 [71] L13-1-->L12-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 12))) (and (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 16) (select |v_#length_9| |v_ULTIMATE.start_main_~#a~0.base_19|)) (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#a~0.base_19|) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19|) .cse0 (+ |v_ULTIMATE.start_main_#t~mem1_6| (- 1))))) (<= 0 .cse0))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|, #length=|v_#length_9|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem1] 92#L12-3 [2020-06-21 22:55:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2132, now seen corresponding path program 1 times [2020-06-21 22:55:58,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:55:58,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:55:58,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:55:58,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash 101348, now seen corresponding path program 2 times [2020-06-21 22:55:58,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:55:58,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:55:58,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:58,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:55:58,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash 63585969, now seen corresponding path program 1 times [2020-06-21 22:55:58,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:55:58,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:55:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:58,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:55:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:55:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:58,306 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:55:58,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:55:58,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:55:58,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:55:58,307 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:55:58,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:55:58,307 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:55:58,307 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:55:58,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-21 22:55:58,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:55:58,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:55:58,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:58,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:58,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:58,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:58,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:58,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:55:58,500 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:55:58,500 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:55:58,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:58,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:58,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:55:58,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:58,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:58,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:58,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:55:58,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:55:58,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:58,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:58,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:58,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:58,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:58,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:58,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:55:58,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:55:58,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:58,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:58,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:58,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:58,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:58,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:58,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:55:58,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:55:58,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:58,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:58,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:58,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:58,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:58,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:58,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:55:58,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:55:58,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:58,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:58,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:58,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:58,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:58,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:58,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:55:58,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:55:58,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:55:58,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:55:58,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:55:58,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:55:58,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:55:58,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:55:58,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:55:58,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:55:58,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:55:58,547 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:55:58,549 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:55:58,550 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 22:55:58,550 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:55:58,550 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:55:58,550 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:55:58,550 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_2 + 1 Supporting invariants [] [2020-06-21 22:55:58,555 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-06-21 22:55:58,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-21 22:55:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:55:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:55:58,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:55:58,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:55:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:55:58,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-21 22:55:58,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:55:58,638 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-21 22:55:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:55:58,678 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 22:55:58,678 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-21 22:55:58,678 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-21 22:55:58,678 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1 Second operand 4 states. [2020-06-21 22:55:58,697 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1. Second operand 4 states. Result 8 states and 9 transitions. Complement of second has 6 states. [2020-06-21 22:55:58,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-21 22:55:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-21 22:55:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-06-21 22:55:58,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-21 22:55:58,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:55:58,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-21 22:55:58,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:55:58,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-21 22:55:58,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:55:58,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2020-06-21 22:55:58,702 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-21 22:55:58,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2020-06-21 22:55:58,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-21 22:55:58,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-21 22:55:58,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-21 22:55:58,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-21 22:55:58,703 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:55:58,703 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:55:58,703 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:55:58,703 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-21 22:55:58,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-21 22:55:58,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-21 22:55:58,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-21 22:55:58,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 10:55:58 BasicIcfg [2020-06-21 22:55:58,710 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-21 22:55:58,710 INFO L168 Benchmark]: Toolchain (without parser) took 2601.69 ms. Allocated memory was 514.9 MB in the beginning and 585.6 MB in the end (delta: 70.8 MB). Free memory was 437.9 MB in the beginning and 447.4 MB in the end (delta: -9.4 MB). Peak memory consumption was 61.3 MB. Max. memory is 50.3 GB. [2020-06-21 22:55:58,712 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 457.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-21 22:55:58,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.80 ms. Allocated memory was 514.9 MB in the beginning and 556.3 MB in the end (delta: 41.4 MB). Free memory was 437.4 MB in the beginning and 524.9 MB in the end (delta: -87.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-21 22:55:58,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.15 ms. Allocated memory is still 556.3 MB. Free memory was 524.9 MB in the beginning and 522.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-21 22:55:58,713 INFO L168 Benchmark]: Boogie Preprocessor took 22.39 ms. Allocated memory is still 556.3 MB. Free memory was 522.8 MB in the beginning and 521.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-21 22:55:58,714 INFO L168 Benchmark]: RCFGBuilder took 245.14 ms. Allocated memory is still 556.3 MB. Free memory was 521.7 MB in the beginning and 508.0 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. [2020-06-21 22:55:58,715 INFO L168 Benchmark]: BlockEncodingV2 took 102.01 ms. Allocated memory is still 556.3 MB. Free memory was 508.0 MB in the beginning and 501.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 50.3 GB. [2020-06-21 22:55:58,715 INFO L168 Benchmark]: TraceAbstraction took 514.21 ms. Allocated memory is still 556.3 MB. Free memory was 500.4 MB in the beginning and 464.6 MB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 50.3 GB. [2020-06-21 22:55:58,716 INFO L168 Benchmark]: BuchiAutomizer took 1375.81 ms. Allocated memory was 556.3 MB in the beginning and 585.6 MB in the end (delta: 29.4 MB). Free memory was 464.0 MB in the beginning and 447.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 46.0 MB. Max. memory is 50.3 GB. [2020-06-21 22:55:58,720 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 17 locations, 18 edges - StatisticsResult: Encoded RCFG 11 locations, 18 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 457.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 299.80 ms. Allocated memory was 514.9 MB in the beginning and 556.3 MB in the end (delta: 41.4 MB). Free memory was 437.4 MB in the beginning and 524.9 MB in the end (delta: -87.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.15 ms. Allocated memory is still 556.3 MB. Free memory was 524.9 MB in the beginning and 522.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.39 ms. Allocated memory is still 556.3 MB. Free memory was 522.8 MB in the beginning and 521.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 245.14 ms. Allocated memory is still 556.3 MB. Free memory was 521.7 MB in the beginning and 508.0 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 102.01 ms. Allocated memory is still 556.3 MB. Free memory was 508.0 MB in the beginning and 501.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 514.21 ms. Allocated memory is still 556.3 MB. Free memory was 500.4 MB in the beginning and 464.6 MB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1375.81 ms. Allocated memory was 556.3 MB in the beginning and 585.6 MB in the end (delta: 29.4 MB). Free memory was 464.0 MB in the beginning and 447.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 46.0 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-21 22:55:58,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-21 22:55:58,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (a == 0 && 1 == \valid[a]) && unknown-#length-unknown[a] == 4192 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 6 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2 SDtfs, 12 SDslu, 1 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 14 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[a][a + 12] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[a][a + 12] + 1 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 5 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 8 SDtfs, 53 SDslu, 0 SDs, 0 SdLazy, 71 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp93 ukn50 mio100 lsp43 div100 bol100 ite100 ukn100 eq144 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-21 22:55:52.881 ----------------------------------------------- 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-21 22:55:58.953 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check