./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e9d8db831e66fcf4f47c300fcbd3a74f1185238a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:42:21,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:42:21,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:42:21,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:42:21,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:42:21,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:42:21,322 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:42:21,323 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:42:21,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:42:21,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:42:21,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:42:21,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:42:21,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:42:21,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:42:21,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:42:21,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:42:21,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:42:21,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:42:21,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:42:21,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:42:21,333 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:42:21,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:42:21,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:42:21,336 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:42:21,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:42:21,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:42:21,337 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:42:21,338 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:42:21,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:42:21,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:42:21,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:42:21,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:42:21,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:42:21,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:42:21,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:42:21,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:42:21,342 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:42:21,351 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:42:21,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:42:21,351 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:42:21,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:42:21,352 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:42:21,352 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:42:21,352 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:42:21,352 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:42:21,352 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:42:21,352 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:42:21,353 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:42:21,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:42:21,353 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:42:21,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:42:21,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:42:21,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:42:21,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:42:21,353 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:42:21,353 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:42:21,353 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:42:21,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:42:21,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:42:21,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:42:21,354 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:42:21,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:42:21,354 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:42:21,354 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:42:21,355 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:42:21,355 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9d8db831e66fcf4f47c300fcbd3a74f1185238a [2018-11-10 12:42:21,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:42:21,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:42:21,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:42:21,390 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:42:21,390 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:42:21,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2018-11-10 12:42:21,427 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/data/99c292126/685fe1b3239b47748e62776d1063e4c0/FLAG3f1445457 [2018-11-10 12:42:21,866 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:42:21,867 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2018-11-10 12:42:21,876 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/data/99c292126/685fe1b3239b47748e62776d1063e4c0/FLAG3f1445457 [2018-11-10 12:42:21,884 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/data/99c292126/685fe1b3239b47748e62776d1063e4c0 [2018-11-10 12:42:21,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:42:21,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:42:21,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:42:21,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:42:21,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:42:21,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:42:21" (1/1) ... [2018-11-10 12:42:21,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584d7dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:21, skipping insertion in model container [2018-11-10 12:42:21,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:42:21" (1/1) ... [2018-11-10 12:42:21,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:42:21,921 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:42:22,088 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:42:22,094 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:42:22,122 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:42:22,148 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:42:22,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22 WrapperNode [2018-11-10 12:42:22,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:42:22,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:42:22,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:42:22,149 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:42:22,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... [2018-11-10 12:42:22,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... [2018-11-10 12:42:22,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:42:22,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:42:22,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:42:22,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:42:22,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... [2018-11-10 12:42:22,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... [2018-11-10 12:42:22,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... [2018-11-10 12:42:22,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... [2018-11-10 12:42:22,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... [2018-11-10 12:42:22,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... [2018-11-10 12:42:22,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... [2018-11-10 12:42:22,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:42:22,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:42:22,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:42:22,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:42:22,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:42:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:42:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:42:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:42:22,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:42:22,503 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:42:22,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:42:22 BoogieIcfgContainer [2018-11-10 12:42:22,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:42:22,504 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:42:22,505 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:42:22,507 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:42:22,508 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:42:22,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:42:21" (1/3) ... [2018-11-10 12:42:22,509 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bd031e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:42:22, skipping insertion in model container [2018-11-10 12:42:22,509 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:42:22,509 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:42:22" (2/3) ... [2018-11-10 12:42:22,509 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bd031e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:42:22, skipping insertion in model container [2018-11-10 12:42:22,509 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:42:22,509 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:42:22" (3/3) ... [2018-11-10 12:42:22,511 INFO L375 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2018-11-10 12:42:22,544 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:42:22,544 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:42:22,544 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:42:22,544 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:42:22,544 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:42:22,544 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:42:22,545 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:42:22,545 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:42:22,545 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:42:22,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 12:42:22,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:42:22,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:42:22,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:42:22,572 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:42:22,572 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:22,572 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:42:22,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 12:42:22,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:42:22,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:42:22,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:42:22,575 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:42:22,575 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:22,582 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 21#L550true SUMMARY for call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4); srcloc: L550 24#L550-1true havoc main_#t~nondet4; 17#L551true SUMMARY for call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L551 4#L558-1true [2018-11-10 12:42:22,582 INFO L795 eck$LassoCheckResult]: Loop: 4#L558-1true assume true; 13#L552true SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 18#L552-1true assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 10#L553true SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 14#L553-1true assume !((if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0);havoc main_#t~mem6; 5#L556true SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 6#L556-1true SUMMARY for call write~int(main_#t~mem9 + 2, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 8#L556-2true havoc main_#t~mem9; 22#L553-3true SUMMARY for call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L553-3 3#L558true assume !(main_#t~mem10 != 0);havoc main_#t~mem10; 4#L558-1true [2018-11-10 12:42:22,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 12:42:22,589 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:22,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:22,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:22,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:22,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:22,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:22,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1179724532, now seen corresponding path program 1 times [2018-11-10 12:42:22,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:22,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:22,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:22,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:22,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1663124948, now seen corresponding path program 1 times [2018-11-10 12:42:22,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:22,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:22,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:23,050 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2018-11-10 12:42:23,122 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:42:23,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:42:23,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:42:23,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:42:23,124 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:42:23,124 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:42:23,124 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:42:23,124 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:42:23,124 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 12:42:23,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:42:23,125 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:42:23,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,343 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2018-11-10 12:42:23,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:23,743 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:42:23,747 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:42:23,749 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 [2018-11-10 12:42:23,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:42:23,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:42:23,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:42:23,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,756 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 [2018-11-10 12:42:23,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:42:23,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:42:23,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:42:23,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,758 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 [2018-11-10 12:42:23,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:42:23,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:42:23,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:42:23,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,761 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 [2018-11-10 12:42:23,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,768 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 [2018-11-10 12:42:23,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,773 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 [2018-11-10 12:42:23,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,779 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 [2018-11-10 12:42:23,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:42:23,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:42:23,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:42:23,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,782 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 [2018-11-10 12:42:23,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,790 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 [2018-11-10 12:42:23,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,804 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 [2018-11-10 12:42:23,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,809 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 [2018-11-10 12:42:23,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,810 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:42:23,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:42:23,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,824 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 [2018-11-10 12:42:23,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,842 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 [2018-11-10 12:42:23,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,871 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 [2018-11-10 12:42:23,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,878 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 [2018-11-10 12:42:23,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,879 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:42:23,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,881 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:42:23,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,887 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 [2018-11-10 12:42:23,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,894 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 [2018-11-10 12:42:23,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:23,900 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 [2018-11-10 12:42:23,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:23,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:23,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:23,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:23,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:23,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:23,913 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:42:23,919 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:42:23,919 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:42:23,921 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:42:23,922 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:42:23,923 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:42:23,923 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 255 Supporting invariants [] [2018-11-10 12:42:23,984 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 12:42:23,991 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:42:24,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:42:24,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:42:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:42:24,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:42:24,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:42:24,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-10 12:42:24,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-10 12:42:24,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:42:24,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:24,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:24,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-11-10 12:42:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:42:24,177 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 12:42:24,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 7 states. [2018-11-10 12:42:24,240 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 7 states. Result 65 states and 72 transitions. Complement of second has 12 states. [2018-11-10 12:42:24,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 12:42:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:42:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-10 12:42:24,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-10 12:42:24,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:42:24,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 12:42:24,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:42:24,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2018-11-10 12:42:24,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:42:24,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 72 transitions. [2018-11-10 12:42:24,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:42:24,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 43 states and 48 transitions. [2018-11-10 12:42:24,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-10 12:42:24,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 12:42:24,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 48 transitions. [2018-11-10 12:42:24,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:42:24,252 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-10 12:42:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 48 transitions. [2018-11-10 12:42:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-11-10 12:42:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 12:42:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-10 12:42:24,288 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-10 12:42:24,288 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-10 12:42:24,288 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:42:24,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-11-10 12:42:24,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:42:24,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:42:24,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:42:24,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:24,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:24,290 INFO L793 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 234#L550 SUMMARY for call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4); srcloc: L550 246#L550-1 havoc main_#t~nondet4; 244#L551 SUMMARY for call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L551 245#L558-1 assume true; 220#L552 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 241#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 235#L553 SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 236#L553-1 assume (if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0;havoc main_#t~mem6; 228#L554 [2018-11-10 12:42:24,290 INFO L795 eck$LassoCheckResult]: Loop: 228#L554 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 229#L554-1 main_#t~post8 := main_#t~mem7; 239#L554-2 SUMMARY for call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-2 243#L554-3 havoc main_#t~post8;havoc main_#t~mem7; 230#L553-3 SUMMARY for call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L553-3 252#L558 assume !(main_#t~mem10 != 0);havoc main_#t~mem10; 247#L558-1 assume true; 251#L552 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 250#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 249#L553 SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 248#L553-1 assume (if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0;havoc main_#t~mem6; 228#L554 [2018-11-10 12:42:24,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash -776580784, now seen corresponding path program 1 times [2018-11-10 12:42:24,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:24,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:24,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:24,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:24,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -208747640, now seen corresponding path program 1 times [2018-11-10 12:42:24,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:24,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:24,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:24,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1455564071, now seen corresponding path program 1 times [2018-11-10 12:42:24,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:24,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:24,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:24,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:42:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:42:24,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:42:24,492 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:42:24,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:42:24,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:42:24,588 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:42:24,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-10 12:42:24,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:42:24,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-11-10 12:42:24,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:42:24,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:24,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:24,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:19 [2018-11-10 12:42:24,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-10 12:42:24,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-11-10 12:42:24,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:42:24,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:24,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:24,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:11 [2018-11-10 12:42:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:42:24,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:42:24,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-10 12:42:24,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:42:24,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:42:24,713 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 7 Second operand 13 states. [2018-11-10 12:42:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:42:24,881 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-10 12:42:24,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:42:24,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 52 transitions. [2018-11-10 12:42:24,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 12:42:24,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 52 transitions. [2018-11-10 12:42:24,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 12:42:24,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 12:42:24,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 52 transitions. [2018-11-10 12:42:24,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:42:24,884 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-10 12:42:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 52 transitions. [2018-11-10 12:42:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-10 12:42:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 12:42:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-10 12:42:24,886 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-10 12:42:24,886 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-10 12:42:24,886 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:42:24,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2018-11-10 12:42:24,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 12:42:24,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:42:24,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:42:24,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:24,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:24,888 INFO L793 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 402#L550 SUMMARY for call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4); srcloc: L550 415#L550-1 havoc main_#t~nondet4; 412#L551 SUMMARY for call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L551 413#L558-1 assume true; 417#L552 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 423#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 421#L553 SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 416#L553-1 assume (if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0;havoc main_#t~mem6; 396#L554 [2018-11-10 12:42:24,888 INFO L795 eck$LassoCheckResult]: Loop: 396#L554 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 397#L554-1 main_#t~post8 := main_#t~mem7; 407#L554-2 SUMMARY for call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-2 411#L554-3 havoc main_#t~post8;havoc main_#t~mem7; 414#L553-3 SUMMARY for call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L553-3 383#L558 assume !(main_#t~mem10 != 0);havoc main_#t~mem10; 385#L558-1 assume true; 388#L552 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 409#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 403#L553 SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 404#L553-1 assume !((if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0);havoc main_#t~mem6; 390#L556 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 391#L556-1 SUMMARY for call write~int(main_#t~mem9 + 2, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 394#L556-2 havoc main_#t~mem9; 398#L553-3 SUMMARY for call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L553-3 425#L558 assume !(main_#t~mem10 != 0);havoc main_#t~mem10; 424#L558-1 assume true; 422#L552 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 420#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 419#L553 SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 418#L553-1 assume (if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0;havoc main_#t~mem6; 396#L554 [2018-11-10 12:42:24,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash -776580784, now seen corresponding path program 2 times [2018-11-10 12:42:24,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:24,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:24,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:24,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1940398243, now seen corresponding path program 1 times [2018-11-10 12:42:24,899 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:24,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:24,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:42:24,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:42:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:42:24,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:42:24,985 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9443f4f-b47d-45da-9cbc-29bc1e8b465b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:42:24,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:42:25,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:42:25,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:42:25,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 12:42:25,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:42:25,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-11-10 12:42:25,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:42:25,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:25,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:25,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:19 [2018-11-10 12:42:25,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-10 12:42:25,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-11-10 12:42:25,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:42:25,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:25,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:25,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-11-10 12:42:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:42:25,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:42:25,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-11-10 12:42:25,119 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:42:25,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:42:25,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:42:25,120 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-11-10 12:42:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:42:25,207 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-11-10 12:42:25,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:42:25,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 63 transitions. [2018-11-10 12:42:25,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 12:42:25,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 54 states and 58 transitions. [2018-11-10 12:42:25,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 12:42:25,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 12:42:25,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2018-11-10 12:42:25,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:42:25,210 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-10 12:42:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2018-11-10 12:42:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2018-11-10 12:42:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 12:42:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-10 12:42:25,212 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-10 12:42:25,212 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-10 12:42:25,212 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:42:25,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 40 transitions. [2018-11-10 12:42:25,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 12:42:25,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:42:25,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:42:25,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:25,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:25,214 INFO L793 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 583#L550 SUMMARY for call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4); srcloc: L550 596#L550-1 havoc main_#t~nondet4; 593#L551 SUMMARY for call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L551 594#L558-1 assume true; 600#L552 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 599#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 598#L553 SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 597#L553-1 assume (if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0;havoc main_#t~mem6; 577#L554 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 578#L554-1 main_#t~post8 := main_#t~mem7; 588#L554-2 SUMMARY for call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-2 590#L554-3 havoc main_#t~post8;havoc main_#t~mem7; 579#L553-3 [2018-11-10 12:42:25,214 INFO L795 eck$LassoCheckResult]: Loop: 579#L553-3 SUMMARY for call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L553-3 595#L558 assume !(main_#t~mem10 != 0);havoc main_#t~mem10; 568#L558-1 assume true; 569#L552 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 591#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 584#L553 SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 585#L553-1 assume !((if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0);havoc main_#t~mem6; 571#L556 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 572#L556-1 SUMMARY for call write~int(main_#t~mem9 + 2, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 575#L556-2 havoc main_#t~mem9; 579#L553-3 [2018-11-10 12:42:25,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:25,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2137585006, now seen corresponding path program 1 times [2018-11-10 12:42:25,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:25,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:25,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:25,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:25,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:25,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1597643700, now seen corresponding path program 2 times [2018-11-10 12:42:25,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:25,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:25,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:25,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash -719213155, now seen corresponding path program 1 times [2018-11-10 12:42:25,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:25,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:25,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:42:25,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:25,504 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2018-11-10 12:42:25,673 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-10 12:42:25,675 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:42:25,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:42:25,675 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:42:25,675 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:42:25,675 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:42:25,675 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:42:25,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:42:25,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:42:25,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 12:42:25,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:42:25,676 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:42:25,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:25,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:42:26,202 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:42:26,202 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:42:26,203 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 [2018-11-10 12:42:26,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:42:26,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:42:26,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:42:26,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:26,205 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 [2018-11-10 12:42:26,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:42:26,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:42:26,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:42:26,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:26,208 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 [2018-11-10 12:42:26,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:42:26,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:42:26,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:42:26,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:26,210 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 [2018-11-10 12:42:26,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:42:26,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:42:26,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:42:26,211 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:26,211 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 [2018-11-10 12:42:26,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:42:26,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:42:26,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:42:26,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:26,213 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 [2018-11-10 12:42:26,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:26,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:26,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:26,216 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 [2018-11-10 12:42:26,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:26,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:26,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:26,220 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 [2018-11-10 12:42:26,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:26,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:26,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:26,228 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 [2018-11-10 12:42:26,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:26,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:26,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:42:26,232 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 [2018-11-10 12:42:26,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:42:26,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:42:26,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:42:26,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:42:26,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:42:26,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:42:26,241 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:42:26,245 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:42:26,246 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:42:26,246 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:42:26,247 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:42:26,247 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:42:26,247 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 255 Supporting invariants [] [2018-11-10 12:42:26,287 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 12:42:26,288 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:42:26,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:42:26,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:42:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:42:26,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:42:26,346 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:42:26,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-10 12:42:26,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-10 12:42:26,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:42:26,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:26,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:42:26,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-11-10 12:42:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:42:26,368 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 12:42:26,368 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 40 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-10 12:42:26,396 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 40 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 71 states and 78 transitions. Complement of second has 11 states. [2018-11-10 12:42:26,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 12:42:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:42:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-10 12:42:26,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 14 letters. Loop has 10 letters. [2018-11-10 12:42:26,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:42:26,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 24 letters. Loop has 10 letters. [2018-11-10 12:42:26,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:42:26,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 14 letters. Loop has 20 letters. [2018-11-10 12:42:26,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:42:26,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 78 transitions. [2018-11-10 12:42:26,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 12:42:26,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 63 states and 69 transitions. [2018-11-10 12:42:26,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 12:42:26,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 12:42:26,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 69 transitions. [2018-11-10 12:42:26,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:42:26,401 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-11-10 12:42:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 69 transitions. [2018-11-10 12:42:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2018-11-10 12:42:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 12:42:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-10 12:42:26,403 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-10 12:42:26,403 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-10 12:42:26,403 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:42:26,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2018-11-10 12:42:26,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 12:42:26,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:42:26,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:42:26,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:26,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:42:26,405 INFO L793 eck$LassoCheckResult]: Stem: 846#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 839#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 840#L550 SUMMARY for call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4); srcloc: L550 853#L550-1 havoc main_#t~nondet4; 850#L551 SUMMARY for call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L551 851#L558-1 assume true; 827#L552 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 848#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 843#L553 SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 844#L553-1 assume !((if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0);havoc main_#t~mem6; 830#L556 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 831#L556-1 SUMMARY for call write~int(main_#t~mem9 + 2, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 833#L556-2 havoc main_#t~mem9; 835#L553-3 SUMMARY for call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L553-3 821#L558 assume main_#t~mem10 != 0;havoc main_#t~mem10; 822#L559 [2018-11-10 12:42:26,405 INFO L795 eck$LassoCheckResult]: Loop: 822#L559 SUMMARY for call write~int(0, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 825#L558-1 assume true; 826#L552 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 847#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5; 841#L553 SUMMARY for call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 842#L553-1 assume !((if main_#t~mem6 < 0 && main_#t~mem6 % 2 != 0 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2) != 0);havoc main_#t~mem6; 828#L556 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 829#L556-1 SUMMARY for call write~int(main_#t~mem9 + 2, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 832#L556-2 havoc main_#t~mem9; 834#L553-3 SUMMARY for call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); srcloc: L553-3 858#L558 assume main_#t~mem10 != 0;havoc main_#t~mem10; 822#L559 [2018-11-10 12:42:26,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1663124951, now seen corresponding path program 1 times [2018-11-10 12:42:26,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:26,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:26,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:42:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:42:26,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:42:26,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:42:26,462 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:42:26,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:42:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2017445878, now seen corresponding path program 1 times [2018-11-10 12:42:26,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:42:26,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:42:26,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:26,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:42:26,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:42:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:42:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:42:26,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:42:26,533 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 12:42:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:42:26,557 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-10 12:42:26,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:42:26,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2018-11-10 12:42:26,560 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:42:26,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-11-10 12:42:26,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:42:26,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:42:26,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:42:26,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:42:26,560 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:42:26,560 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:42:26,560 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:42:26,561 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:42:26,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:42:26,561 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:42:26,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:42:26,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:42:26 BoogieIcfgContainer [2018-11-10 12:42:26,566 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:42:26,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:42:26,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:42:26,566 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:42:26,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:42:22" (3/4) ... [2018-11-10 12:42:26,570 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:42:26,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:42:26,571 INFO L168 Benchmark]: Toolchain (without parser) took 4683.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.6 MB). Free memory was 952.2 MB in the beginning and 1.3 GB in the end (delta: -309.7 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:42:26,571 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:42:26,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.31 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 930.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:42:26,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 930.7 MB in the beginning and 1.1 GB in the end (delta: -211.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:42:26,573 INFO L168 Benchmark]: Boogie Preprocessor took 20.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:42:26,573 INFO L168 Benchmark]: RCFGBuilder took 260.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:42:26,573 INFO L168 Benchmark]: BuchiAutomizer took 4061.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -147.2 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:42:26,574 INFO L168 Benchmark]: Witness Printer took 3.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:42:26,577 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.31 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 930.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 930.7 MB in the beginning and 1.1 GB in the end (delta: -211.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 260.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4061.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -147.2 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 7 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 96 SDslu, 209 SDs, 0 SdLazy, 305 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital250 mio100 ax107 hnf100 lsp89 ukn75 mio100 lsp36 div139 bol100 ite100 ukn100 eq167 hnf77 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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! Received shutdown request...