./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/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 0233d496bfaf5cb1311bfa260a57f41458184795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:31:33,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:31:33,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:31:33,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:31:33,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:31:33,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:31:33,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:31:33,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:31:33,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:31:33,197 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:31:33,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:31:33,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:31:33,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:31:33,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:31:33,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:31:33,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:31:33,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:31:33,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:31:33,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:31:33,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:31:33,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:31:33,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:31:33,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:31:33,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:31:33,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:31:33,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:31:33,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:31:33,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:31:33,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:31:33,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:31:33,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:31:33,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:31:33,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:31:33,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:31:33,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:31:33,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:31:33,209 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 08:31:33,217 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:31:33,217 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:31:33,218 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:31:33,218 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:31:33,218 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 08:31:33,218 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 08:31:33,218 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 08:31:33,218 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 08:31:33,218 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 08:31:33,218 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 08:31:33,219 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 08:31:33,219 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:31:33,219 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 08:31:33,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:31:33,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:31:33,219 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 08:31:33,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 08:31:33,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 08:31:33,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:31:33,220 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 08:31:33,220 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:31:33,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 08:31:33,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:31:33,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:31:33,220 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 08:31:33,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:31:33,220 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 08:31:33,221 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 08:31:33,221 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 08:31:33,221 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_e8b09cef-d75a-489e-bad1-e23972eb68a4/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 -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2018-12-02 08:31:33,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:31:33,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:31:33,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:31:33,249 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:31:33,250 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:31:33,250 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-02 08:31:33,284 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/data/ce8ca62d9/2ab1a017e8e145238a164beb8bcbfadd/FLAG4f77a7d98 [2018-12-02 08:31:33,617 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:31:33,617 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-02 08:31:33,621 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/data/ce8ca62d9/2ab1a017e8e145238a164beb8bcbfadd/FLAG4f77a7d98 [2018-12-02 08:31:34,020 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/data/ce8ca62d9/2ab1a017e8e145238a164beb8bcbfadd [2018-12-02 08:31:34,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:31:34,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:31:34,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:31:34,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:31:34,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:31:34,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3033e242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34, skipping insertion in model container [2018-12-02 08:31:34,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:31:34,042 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:31:34,137 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:31:34,143 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:31:34,154 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:31:34,162 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:31:34,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34 WrapperNode [2018-12-02 08:31:34,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:31:34,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:31:34,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:31:34,163 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:31:34,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:31:34,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:31:34,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:31:34,188 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:31:34,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... [2018-12-02 08:31:34,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:31:34,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:31:34,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:31:34,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:31:34,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/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-12-02 08:31:34,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:31:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:31:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:31:34,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:31:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 08:31:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:31:34,397 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:31:34,397 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 08:31:34,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:31:34 BoogieIcfgContainer [2018-12-02 08:31:34,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:31:34,398 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 08:31:34,398 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 08:31:34,400 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 08:31:34,401 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 08:31:34,401 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 08:31:34" (1/3) ... [2018-12-02 08:31:34,402 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f596d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:31:34, skipping insertion in model container [2018-12-02 08:31:34,402 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 08:31:34,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:31:34" (2/3) ... [2018-12-02 08:31:34,402 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f596d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:31:34, skipping insertion in model container [2018-12-02 08:31:34,403 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 08:31:34,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:31:34" (3/3) ... [2018-12-02 08:31:34,404 INFO L375 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-02 08:31:34,446 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:31:34,446 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 08:31:34,446 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 08:31:34,446 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 08:31:34,446 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:31:34,446 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:31:34,446 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 08:31:34,447 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:31:34,447 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 08:31:34,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-02 08:31:34,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:34,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:34,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:34,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 08:31:34,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 08:31:34,473 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 08:31:34,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-02 08:31:34,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:34,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:34,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:34,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 08:31:34,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 08:31:34,478 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2018-12-02 08:31:34,479 INFO L796 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2018-12-02 08:31:34,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 08:31:34,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:34,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:34,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:34,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-12-02 08:31:34,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:34,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:34,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:34,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:34,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:34,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:34,583 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-12-02 08:31:34,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:34,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:34,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:34,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:34,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:35,019 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-12-02 08:31:35,154 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-12-02 08:31:35,162 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 08:31:35,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 08:31:35,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 08:31:35,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 08:31:35,163 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 08:31:35,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 08:31:35,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 08:31:35,163 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 08:31:35,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Lasso [2018-12-02 08:31:35,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 08:31:35,164 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 08:31:35,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:35,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:35,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:35,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:35,485 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-12-02 08:31:35,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:35,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:35,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:35,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:35,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:35,882 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 08:31:35,885 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 08:31:35,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-12-02 08:31:35,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:35,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:35,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:35,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,891 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-12-02 08:31:35,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:35,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,896 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-12-02 08:31:35,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:35,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:35,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:35,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,898 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-12-02 08:31:35,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:35,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,923 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-12-02 08:31:35,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,924 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:35,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,925 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:35,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,930 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-12-02 08:31:35,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,931 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:35,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,932 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:35,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,937 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-12-02 08:31:35,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:35,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,943 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-12-02 08:31:35,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:35,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,946 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-12-02 08:31:35,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,946 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:35,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,947 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:35,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,964 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-12-02 08:31:35,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:35,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,969 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-12-02 08:31:35,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:35,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,974 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-12-02 08:31:35,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:35,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,979 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-12-02 08:31:35,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:35,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,984 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-12-02 08:31:35,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:35,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,992 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-12-02 08:31:35,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,993 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:35,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:35,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:35,994 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:35,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:35,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:35,999 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-12-02 08:31:35,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:35,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:35,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:36,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:36,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:36,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:36,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:36,005 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-12-02 08:31:36,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:36,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:36,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:36,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:36,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:36,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:36,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:36,010 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-12-02 08:31:36,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:36,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:36,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:36,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:36,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:36,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:36,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:36,013 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-12-02 08:31:36,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:36,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:36,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:36,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:36,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:36,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:36,018 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 08:31:36,024 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 08:31:36,024 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 08:31:36,026 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 08:31:36,027 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 08:31:36,027 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 08:31:36,027 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2018-12-02 08:31:36,117 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-12-02 08:31:36,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 08:31:36,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:36,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:36,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:36,180 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 08:31:36,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2018-12-02 08:31:36,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2018-12-02 08:31:36,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 08:31:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 08:31:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-12-02 08:31:36,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-12-02 08:31:36,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:36,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-02 08:31:36,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:36,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-02 08:31:36,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:36,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2018-12-02 08:31:36,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:36,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2018-12-02 08:31:36,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 08:31:36,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 08:31:36,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2018-12-02 08:31:36,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:36,221 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-02 08:31:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2018-12-02 08:31:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 08:31:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 08:31:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-12-02 08:31:36,238 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-02 08:31:36,238 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-02 08:31:36,238 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 08:31:36,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-12-02 08:31:36,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:36,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:36,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:36,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 08:31:36,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 08:31:36,239 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 243#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 244#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 253#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 246#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2018-12-02 08:31:36,239 INFO L796 eck$LassoCheckResult]: Loop: 247#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 250#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 251#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 255#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2018-12-02 08:31:36,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-02 08:31:36,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:36,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:31:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:31:36,338 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 08:31:36,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2018-12-02 08:31:36,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:36,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:36,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:36,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:31:36,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:31:36,415 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-02 08:31:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:31:36,482 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-02 08:31:36,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:31:36,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-12-02 08:31:36,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:36,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2018-12-02 08:31:36,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 08:31:36,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 08:31:36,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-02 08:31:36,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:36,484 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 08:31:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-02 08:31:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-02 08:31:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 08:31:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-02 08:31:36,485 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 08:31:36,485 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 08:31:36,485 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 08:31:36,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-02 08:31:36,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 08:31:36,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:36,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:36,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-02 08:31:36,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 08:31:36,487 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 285#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 286#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 292#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 290#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 291#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 293#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 288#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2018-12-02 08:31:36,487 INFO L796 eck$LassoCheckResult]: Loop: 289#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 295#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 296#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 297#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2018-12-02 08:31:36,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-12-02 08:31:36,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:36,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:36,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2018-12-02 08:31:36,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:36,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:36,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:36,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2018-12-02 08:31:36,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:36,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:36,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:31:36,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/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-12-02 08:31:36,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:36,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:36,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:36,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 08:31:36,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:36,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:36,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 08:31:36,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-12-02 08:31:36,667 INFO L478 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 11 treesize of output 8 [2018-12-02 08:31:36,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:36,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-02 08:31:36,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:36,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-02 08:31:36,691 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-12-02 08:31:36,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-12-02 08:31:36,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 08:31:36,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:36,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 08:31:36,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2018-12-02 08:31:36,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 08:31:36,746 INFO L478 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 11 treesize of output 3 [2018-12-02 08:31:36,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,750 INFO L478 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 5 treesize of output 1 [2018-12-02 08:31:36,750 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:36,753 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-12-02 08:31:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:36,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:31:36,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-02 08:31:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 08:31:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:31:36,836 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 11 states. [2018-12-02 08:31:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:31:36,939 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-02 08:31:36,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:31:36,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-12-02 08:31:36,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 08:31:36,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-12-02 08:31:36,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 08:31:36,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-02 08:31:36,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-12-02 08:31:36,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 08:31:36,941 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-02 08:31:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-12-02 08:31:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-12-02 08:31:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 08:31:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-02 08:31:36,942 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-02 08:31:36,942 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-02 08:31:36,942 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 08:31:36,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-12-02 08:31:36,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 08:31:36,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:36,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:36,942 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 08:31:36,942 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-12-02 08:31:36,943 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 374#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 375#L24-2 [2018-12-02 08:31:36,943 INFO L796 eck$LassoCheckResult]: Loop: 375#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 384#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 376#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 377#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 379#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 382#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 383#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 375#L24-2 [2018-12-02 08:31:36,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 08:31:36,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:36,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2018-12-02 08:31:36,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:36,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:36,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:36,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2018-12-02 08:31:36,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:36,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:37,381 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-12-02 08:31:37,501 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-12-02 08:31:37,502 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 08:31:37,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 08:31:37,503 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 08:31:37,503 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 08:31:37,503 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 08:31:37,503 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 08:31:37,503 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 08:31:37,503 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 08:31:37,503 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2018-12-02 08:31:37,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 08:31:37,503 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 08:31:37,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:37,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:37,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:37,774 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-12-02 08:31:37,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:37,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:37,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:37,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:37,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:37,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:37,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:38,178 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 08:31:38,178 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 08:31:38,178 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-12-02 08:31:38,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:38,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:38,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:38,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:38,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:38,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:38,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:38,181 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-12-02 08:31:38,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:38,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:38,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:38,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:38,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:38,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:38,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:38,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:38,182 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-12-02 08:31:38,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:38,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:38,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:38,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:38,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:38,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:38,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:38,185 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-12-02 08:31:38,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:38,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:38,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:38,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:38,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:38,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:38,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:38,188 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-12-02 08:31:38,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:38,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:38,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:38,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:38,189 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:38,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:38,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:38,191 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-12-02 08:31:38,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:38,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:38,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:38,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:38,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:38,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:38,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:38,193 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-12-02 08:31:38,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:38,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:38,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:38,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:38,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:38,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:38,196 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 08:31:38,198 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 08:31:38,198 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 08:31:38,198 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 08:31:38,199 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 08:31:38,199 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 08:31:38,199 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2018-12-02 08:31:38,286 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-12-02 08:31:38,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 08:31:38,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:38,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:38,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:38,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2018-12-02 08:31:38,338 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-12-02 08:31:38,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2018-12-02 08:31:38,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-02 08:31:38,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:31:38,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:31:38,397 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-12-02 08:31:38,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,423 INFO L478 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 29 treesize of output 30 [2018-12-02 08:31:38,424 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-12-02 08:31:38,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,450 INFO L478 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 41 treesize of output 40 [2018-12-02 08:31:38,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-02 08:31:38,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-12-02 08:31:38,481 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-12-02 08:31:38,482 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 08:31:38,499 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-12-02 08:31:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:38,529 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 08:31:38,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-12-02 08:31:38,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 13 states. [2018-12-02 08:31:38,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-02 08:31:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 08:31:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-02 08:31:38,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-12-02 08:31:38,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:38,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-12-02 08:31:38,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:38,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-12-02 08:31:38,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:38,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-12-02 08:31:38,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 08:31:38,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-12-02 08:31:38,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 08:31:38,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 08:31:38,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-12-02 08:31:38,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:38,609 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-02 08:31:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-12-02 08:31:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-02 08:31:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 08:31:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-12-02 08:31:38,610 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-02 08:31:38,610 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-02 08:31:38,610 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 08:31:38,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-12-02 08:31:38,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 08:31:38,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:38,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:38,611 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-02 08:31:38,611 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 08:31:38,611 INFO L794 eck$LassoCheckResult]: Stem: 647#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 641#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 642#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 652#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 653#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 666#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 665#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 664#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 655#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2018-12-02 08:31:38,611 INFO L796 eck$LassoCheckResult]: Loop: 651#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 648#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 649#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 661#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 660#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2018-12-02 08:31:38,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2018-12-02 08:31:38,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:38,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:38,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:38,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:31:38,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/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-12-02 08:31:38,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:38,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:38,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-02 08:31:38,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-02 08:31:38,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 08:31:38,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 68 [2018-12-02 08:31:38,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:38,834 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2018-12-02 08:31:38,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:38,846 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-12-02 08:31:38,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:38,860 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-12-02 08:31:38,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:38,877 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,885 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,889 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,893 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,897 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 08:31:38,907 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:157, output treesize:53 [2018-12-02 08:31:38,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:38,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2018-12-02 08:31:38,932 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-12-02 08:31:38,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:38,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 08:31:38,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:53 [2018-12-02 08:31:39,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-12-02 08:31:39,035 INFO L478 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 11 treesize of output 3 [2018-12-02 08:31:39,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,046 INFO L478 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 5 treesize of output 1 [2018-12-02 08:31:39,046 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,050 INFO L478 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 5 treesize of output 1 [2018-12-02 08:31:39,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,054 INFO L478 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 5 treesize of output 1 [2018-12-02 08:31:39,054 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,061 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:76, output treesize:3 [2018-12-02 08:31:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:39,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:31:39,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-12-02 08:31:39,086 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 08:31:39,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2018-12-02 08:31:39,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:39,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:39,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:39,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 08:31:39,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:31:39,184 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-12-02 08:31:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:31:39,358 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-02 08:31:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:31:39,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2018-12-02 08:31:39,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 08:31:39,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-12-02 08:31:39,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-02 08:31:39,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-02 08:31:39,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-12-02 08:31:39,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:39,360 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 08:31:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-12-02 08:31:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-02 08:31:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 08:31:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-02 08:31:39,362 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 08:31:39,362 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 08:31:39,362 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 08:31:39,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-02 08:31:39,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 08:31:39,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:39,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:39,363 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-12-02 08:31:39,363 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 08:31:39,363 INFO L794 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 760#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 761#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 771#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 765#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 766#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 779#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 776#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 775#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 769#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 770#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 773#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 785#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 784#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 783#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 774#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2018-12-02 08:31:39,363 INFO L796 eck$LassoCheckResult]: Loop: 772#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 767#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 768#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 780#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 778#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2018-12-02 08:31:39,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2018-12-02 08:31:39,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:39,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:39,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:39,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:39,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:39,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2018-12-02 08:31:39,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:39,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:39,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:39,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:39,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:39,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2018-12-02 08:31:39,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:39,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:39,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:39,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:39,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 08:31:39,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:31:39,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:31:39,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:39,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:39,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:39,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 08:31:39,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:39,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:39,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 08:31:39,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-02 08:31:39,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:31:39,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:39,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-02 08:31:39,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:31:39,551 INFO L478 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 11 treesize of output 3 [2018-12-02 08:31:39,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-12-02 08:31:39,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:31:39,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:39,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-02 08:31:39,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 08:31:39,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:39,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 08:31:39,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-12-02 08:31:39,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 08:31:39,643 INFO L478 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 5 treesize of output 1 [2018-12-02 08:31:39,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,648 INFO L478 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 11 treesize of output 3 [2018-12-02 08:31:39,648 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:39,653 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2018-12-02 08:31:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 08:31:39,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:31:39,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-12-02 08:31:39,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 08:31:39,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-12-02 08:31:39,770 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 14 states. [2018-12-02 08:31:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:31:40,049 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-02 08:31:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 08:31:40,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions. [2018-12-02 08:31:40,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-12-02 08:31:40,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 44 transitions. [2018-12-02 08:31:40,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 08:31:40,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-02 08:31:40,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2018-12-02 08:31:40,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:40,051 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-02 08:31:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2018-12-02 08:31:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-12-02 08:31:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 08:31:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-02 08:31:40,052 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-02 08:31:40,052 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-02 08:31:40,052 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 08:31:40,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2018-12-02 08:31:40,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-12-02 08:31:40,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:40,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:40,053 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-12-02 08:31:40,053 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 08:31:40,053 INFO L794 eck$LassoCheckResult]: Stem: 938#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 932#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 933#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 943#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 936#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 937#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 959#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 951#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 949#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 941#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 942#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 946#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 964#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 963#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 962#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 950#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 944#L24 [2018-12-02 08:31:40,054 INFO L796 eck$LassoCheckResult]: Loop: 944#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 939#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 940#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 960#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 958#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 944#L24 [2018-12-02 08:31:40,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2018-12-02 08:31:40,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:40,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:40,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:40,070 INFO L82 PathProgramCache]: Analyzing trace with hash 53784836, now seen corresponding path program 1 times [2018-12-02 08:31:40,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:40,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:40,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:40,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:40,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:31:40,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:31:40,080 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 08:31:40,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:31:40,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:31:40,080 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-02 08:31:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:31:40,099 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-12-02 08:31:40,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:31:40,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-12-02 08:31:40,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-02 08:31:40,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2018-12-02 08:31:40,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-02 08:31:40,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 08:31:40,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2018-12-02 08:31:40,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:40,100 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-02 08:31:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2018-12-02 08:31:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-02 08:31:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 08:31:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-02 08:31:40,101 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-02 08:31:40,101 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-02 08:31:40,101 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 08:31:40,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2018-12-02 08:31:40,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-02 08:31:40,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:40,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:40,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-12-02 08:31:40,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2018-12-02 08:31:40,102 INFO L794 eck$LassoCheckResult]: Stem: 1010#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1008#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1009#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1025#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1013#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1014#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1017#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1020#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1022#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1023#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1026#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1038#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1037#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1036#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1035#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1024#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1018#L24 [2018-12-02 08:31:40,102 INFO L796 eck$LassoCheckResult]: Loop: 1018#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1019#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1031#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1030#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1029#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1028#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1027#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1021#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1015#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1016#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1011#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1012#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1034#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1032#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1033#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1018#L24 [2018-12-02 08:31:40,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:40,102 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2018-12-02 08:31:40,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:40,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:40,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:40,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2018-12-02 08:31:40,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:40,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:40,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:40,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:40,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2018-12-02 08:31:40,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:40,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:40,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:31:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:40,598 WARN L180 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2018-12-02 08:31:40,727 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-02 08:31:42,813 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 189 DAG size of output: 159 [2018-12-02 08:31:43,244 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-12-02 08:31:43,246 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 08:31:43,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 08:31:43,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 08:31:43,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 08:31:43,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 08:31:43,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 08:31:43,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 08:31:43,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 08:31:43,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Lasso [2018-12-02 08:31:43,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 08:31:43,247 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 08:31:43,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:43,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:43,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:43,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:43,667 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2018-12-02 08:31:43,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:43,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:43,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:43,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:43,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:44,062 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 08:31:44,062 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 08:31:44,063 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-12-02 08:31:44,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:44,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:44,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:44,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,065 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-12-02 08:31:44,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:44,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,067 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-12-02 08:31:44,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:44,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:44,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:44,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,068 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-12-02 08:31:44,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,068 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:44,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,069 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:44,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,071 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-12-02 08:31:44,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,071 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:44,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,072 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:44,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,074 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-12-02 08:31:44,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,074 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:44,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,075 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:44,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,076 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-12-02 08:31:44,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:44,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,079 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-12-02 08:31:44,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:44,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,081 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-12-02 08:31:44,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:44,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,093 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-12-02 08:31:44,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,093 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:31:44,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,094 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:31:44,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,096 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-12-02 08:31:44,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:44,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,098 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-12-02 08:31:44,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:44,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,101 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-12-02 08:31:44,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:44,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:44,102 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-12-02 08:31:44,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:44,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:44,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:44,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:44,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:44,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:44,106 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 08:31:44,109 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 08:31:44,109 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 08:31:44,110 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 08:31:44,110 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 08:31:44,110 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 08:31:44,110 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2018-12-02 08:31:44,226 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2018-12-02 08:31:44,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:44,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:44,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:44,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-02 08:31:44,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:44,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:31:44,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-12-02 08:31:44,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 42 [2018-12-02 08:31:44,310 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-12-02 08:31:44,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-12-02 08:31:44,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:44,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 08:31:44,343 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:62 [2018-12-02 08:31:44,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-12-02 08:31:44,372 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-12-02 08:31:44,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,396 INFO L478 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 50 treesize of output 49 [2018-12-02 08:31:44,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 08:31:44,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 08:31:44,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:72 [2018-12-02 08:31:44,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 64 [2018-12-02 08:31:44,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 33 [2018-12-02 08:31:44,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 08:31:44,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,556 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-02 08:31:44,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-12-02 08:31:44,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2018-12-02 08:31:44,635 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 08:31:44,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-02 08:31:44,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-02 08:31:44,698 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:43, output treesize:149 [2018-12-02 08:31:44,756 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:31:44,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2018-12-02 08:31:44,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-02 08:31:44,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-12-02 08:31:44,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-12-02 08:31:44,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:44,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:44,987 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-02 08:31:44,987 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-12-02 08:31:45,033 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:31:45,142 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:31:45,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-12-02 08:31:45,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-02 08:31:45,144 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,154 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 64 [2018-12-02 08:31:45,230 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-12-02 08:31:45,230 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2018-12-02 08:31:45,262 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,286 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:45,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-12-02 08:31:45,352 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:193, output treesize:297 [2018-12-02 08:31:45,498 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2018-12-02 08:31:45,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-12-02 08:31:45,513 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-12-02 08:31:45,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-12-02 08:31:45,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 08:31:45,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,640 INFO L478 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 54 treesize of output 51 [2018-12-02 08:31:45,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 34 [2018-12-02 08:31:45,649 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 08:31:45,666 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:45,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 67 [2018-12-02 08:31:45,730 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-12-02 08:31:45,730 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:45,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:45,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 43 [2018-12-02 08:31:45,766 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 08:31:45,786 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:45,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2018-12-02 08:31:45,840 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:216 [2018-12-02 08:31:46,021 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2018-12-02 08:31:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:46,021 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-12-02 08:31:46,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-12-02 08:31:46,481 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 46 states and 50 transitions. Complement of second has 22 states. [2018-12-02 08:31:46,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-12-02 08:31:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 08:31:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-12-02 08:31:46,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 15 letters. [2018-12-02 08:31:46,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:46,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 31 letters. Loop has 15 letters. [2018-12-02 08:31:46,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:46,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 30 letters. [2018-12-02 08:31:46,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:46,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2018-12-02 08:31:46,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 08:31:46,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2018-12-02 08:31:46,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-02 08:31:46,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 08:31:46,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2018-12-02 08:31:46,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:46,485 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-12-02 08:31:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2018-12-02 08:31:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-12-02 08:31:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 08:31:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-02 08:31:46,487 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-02 08:31:46,487 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-02 08:31:46,487 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 08:31:46,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2018-12-02 08:31:46,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 08:31:46,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:46,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:46,488 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2018-12-02 08:31:46,488 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-12-02 08:31:46,488 INFO L794 eck$LassoCheckResult]: Stem: 1409#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1403#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1404#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1416#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1407#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1408#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1437#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1435#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1418#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1419#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1432#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1430#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1428#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1426#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1424#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1422#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1414#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1410#L24-2 [2018-12-02 08:31:46,488 INFO L796 eck$LassoCheckResult]: Loop: 1410#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1411#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1405#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1406#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1441#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1440#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1417#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1410#L24-2 [2018-12-02 08:31:46,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2018-12-02 08:31:46,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:46,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:46,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:46,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:46,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:46,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2018-12-02 08:31:46,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:46,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:46,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:46,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:46,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:46,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:46,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2018-12-02 08:31:46,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:46,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:46,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:48,577 WARN L180 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 194 DAG size of output: 155 [2018-12-02 08:31:48,972 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-02 08:31:48,974 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 08:31:48,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 08:31:48,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 08:31:48,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 08:31:48,975 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 08:31:48,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 08:31:48,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 08:31:48,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 08:31:48,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Lasso [2018-12-02 08:31:48,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 08:31:48,975 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 08:31:48,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:48,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:48,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:48,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:48,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:48,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:48,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:48,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:31:49,344 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-12-02 08:31:49,640 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 08:31:49,640 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 08:31:49,640 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-12-02 08:31:49,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:49,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:49,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:49,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:49,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:49,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:49,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:49,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:49,641 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-12-02 08:31:49,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:49,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:49,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:49,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:49,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:49,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:49,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:49,643 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-12-02 08:31:49,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:49,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:49,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:49,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:49,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:49,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:49,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:49,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:49,644 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-12-02 08:31:49,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:49,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:49,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:49,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:49,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:49,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:49,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:49,645 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-12-02 08:31:49,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:49,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:49,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:49,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:49,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:49,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:49,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:49,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:49,647 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-12-02 08:31:49,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:49,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:49,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:49,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:49,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:49,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:49,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:49,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:49,648 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-12-02 08:31:49,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:49,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:31:49,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:49,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:49,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:49,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:31:49,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:31:49,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:31:49,650 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-12-02 08:31:49,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:31:49,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:31:49,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:31:49,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:31:49,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:31:49,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:31:49,652 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 08:31:49,653 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 08:31:49,654 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 08:31:49,654 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 08:31:49,654 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 08:31:49,655 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 08:31:49,655 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2018-12-02 08:31:49,737 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-12-02 08:31:49,737 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 08:31:49,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:49,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:49,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:49,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:49,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2018-12-02 08:31:49,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2018-12-02 08:31:49,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-02 08:31:49,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:49,824 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-02 08:31:49,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:49,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:31:49,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:31:49,855 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-12-02 08:31:49,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:49,885 INFO L478 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 41 treesize of output 40 [2018-12-02 08:31:49,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-02 08:31:49,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:49,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:49,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:49,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-12-02 08:31:49,915 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-12-02 08:31:49,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:49,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:49,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:49,935 INFO L478 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 29 treesize of output 30 [2018-12-02 08:31:49,937 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-12-02 08:31:49,937 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:49,939 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:49,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 08:31:49,952 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-12-02 08:31:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:31:49,980 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 08:31:49,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-12-02 08:31:50,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 79 states and 85 transitions. Complement of second has 13 states. [2018-12-02 08:31:50,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-02 08:31:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 08:31:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-12-02 08:31:50,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2018-12-02 08:31:50,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:50,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2018-12-02 08:31:50,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:50,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2018-12-02 08:31:50,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:31:50,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2018-12-02 08:31:50,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 08:31:50,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 63 transitions. [2018-12-02 08:31:50,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 08:31:50,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 08:31:50,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2018-12-02 08:31:50,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:31:50,059 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-12-02 08:31:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2018-12-02 08:31:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-12-02 08:31:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 08:31:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-12-02 08:31:50,061 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-12-02 08:31:50,061 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-12-02 08:31:50,061 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 08:31:50,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2018-12-02 08:31:50,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 08:31:50,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:31:50,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:31:50,062 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2018-12-02 08:31:50,062 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-12-02 08:31:50,062 INFO L794 eck$LassoCheckResult]: Stem: 1779#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1777#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1778#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1784#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1810#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1809#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1808#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1807#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1806#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1805#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1791#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1780#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1781#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1801#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1799#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1797#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1786#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1787#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1824#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1782#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1783#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1785#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1792#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1817#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1823#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1822#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1821#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1820#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1819#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1818#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1796#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1788#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1789#L24-2 [2018-12-02 08:31:50,062 INFO L796 eck$LassoCheckResult]: Loop: 1789#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1804#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1803#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1802#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1800#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1798#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1793#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1789#L24-2 [2018-12-02 08:31:50,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2018-12-02 08:31:50,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:50,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:50,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:50,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:31:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 08:31:50,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:31:50,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b09cef-d75a-489e-bad1-e23972eb68a4/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:31:50,251 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 08:31:50,283 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-12-02 08:31:50,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:31:50,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:31:50,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-12-02 08:31:50,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 08:31:50,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:9 [2018-12-02 08:31:50,308 INFO L478 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 11 treesize of output 8 [2018-12-02 08:31:50,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:50,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-02 08:31:50,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-12-02 08:31:50,323 INFO L478 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 11 treesize of output 3 [2018-12-02 08:31:50,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-02 08:31:50,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:31:50,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:50,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-02 08:31:50,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 08:31:50,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-02 08:31:50,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-02 08:31:50,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-12-02 08:31:50,378 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-12-02 08:31:50,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2018-12-02 08:31:50,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-12-02 08:31:50,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 35 treesize of output 34 [2018-12-02 08:31:50,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,435 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-12-02 08:31:50,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 08:31:50,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:50,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:50,458 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:60 [2018-12-02 08:31:50,493 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:31:50,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2018-12-02 08:31:50,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-02 08:31:50,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2018-12-02 08:31:50,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-02 08:31:50,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,565 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-12-02 08:31:50,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:50,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:50,596 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:78, output treesize:60 [2018-12-02 08:31:50,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 57 [2018-12-02 08:31:50,635 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-12-02 08:31:50,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2018-12-02 08:31:50,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 08:31:50,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:31:50,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 08:31:50,687 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:50 [2018-12-02 08:31:50,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-12-02 08:31:50,741 INFO L478 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 29 treesize of output 22 [2018-12-02 08:31:50,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:31:50,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 08:31:50,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,769 INFO L478 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 33 treesize of output 28 [2018-12-02 08:31:50,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,780 INFO L478 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 28 treesize of output 21 [2018-12-02 08:31:50,781 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,793 INFO L478 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 16 [2018-12-02 08:31:50,793 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:31:50,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-12-02 08:31:50,818 INFO L478 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 5 treesize of output 1 [2018-12-02 08:31:50,818 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,823 INFO L478 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 11 treesize of output 3 [2018-12-02 08:31:50,823 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,825 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:31:50,831 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:80, output treesize:3 [2018-12-02 08:31:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 08:31:50,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:31:50,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2018-12-02 08:31:50,869 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 08:31:50,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:31:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2018-12-02 08:31:50,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:31:50,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:31:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:50,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:31:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:31:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:31:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 08:31:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-12-02 08:31:50,976 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-12-02 08:31:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:31:51,148 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-12-02 08:31:51,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 08:31:51,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 39 transitions. [2018-12-02 08:31:51,149 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 08:31:51,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2018-12-02 08:31:51,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 08:31:51,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 08:31:51,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 08:31:51,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 08:31:51,149 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:31:51,150 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:31:51,150 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:31:51,150 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 08:31:51,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 08:31:51,150 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 08:31:51,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 08:31:51,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 08:31:51 BoogieIcfgContainer [2018-12-02 08:31:51,154 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 08:31:51,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:31:51,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:31:51,154 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:31:51,154 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:31:34" (3/4) ... [2018-12-02 08:31:51,157 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 08:31:51,157 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:31:51,157 INFO L168 Benchmark]: Toolchain (without parser) took 17134.63 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 438.3 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 333.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:31:51,158 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:31:51,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.90 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:31:51,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.59 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:31:51,158 INFO L168 Benchmark]: Boogie Preprocessor took 15.13 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:31:51,158 INFO L168 Benchmark]: RCFGBuilder took 194.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 08:31:51,158 INFO L168 Benchmark]: BuchiAutomizer took 16756.30 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.0 MB). Peak memory consumption was 353.2 MB. Max. memory is 11.5 GB. [2018-12-02 08:31:51,158 INFO L168 Benchmark]: Witness Printer took 2.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:31:51,159 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.90 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.59 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.13 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 194.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16756.30 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.0 MB). Peak memory consumption was 353.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 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 - 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 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.7s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 12.8s. Construction of modules took 0.4s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 38 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/25 HoareTripleCheckerStatistics: 47 SDtfs, 83 SDslu, 42 SDs, 0 SdLazy, 633 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1982 mio100 ax100 hnf100 lsp98 ukn30 mio100 lsp39 div100 bol100 ite100 ukn100 eq190 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 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...