./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_0e75755d-e04b-43f3-9157-ab2b5744530d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/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_0e75755d-e04b-43f3-9157-ab2b5744530d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/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-09 01:17:24,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:17:24,140 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:17:24,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:17:24,147 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:17:24,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:17:24,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:17:24,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:17:24,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:17:24,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:17:24,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:17:24,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:17:24,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:17:24,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:17:24,152 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:17:24,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:17:24,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:17:24,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:17:24,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:17:24,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:17:24,157 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:17:24,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:17:24,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:17:24,159 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:17:24,159 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:17:24,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:17:24,160 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:17:24,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:17:24,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:17:24,161 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:17:24,161 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:17:24,162 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:17:24,162 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:17:24,162 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:17:24,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:17:24,163 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:17:24,163 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 01:17:24,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:17:24,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:17:24,172 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:17:24,172 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:17:24,172 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:17:24,172 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 01:17:24,173 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 01:17:24,173 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 01:17:24,173 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 01:17:24,173 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 01:17:24,173 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 01:17:24,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:17:24,173 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:17:24,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:17:24,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:17:24,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 01:17:24,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 01:17:24,174 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 01:17:24,174 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:17:24,174 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 01:17:24,174 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:17:24,175 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 01:17:24,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:17:24,175 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:17:24,175 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 01:17:24,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:17:24,175 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:17:24,175 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 01:17:24,176 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 01:17:24,176 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_0e75755d-e04b-43f3-9157-ab2b5744530d/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-09 01:17:24,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:17:24,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:17:24,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:17:24,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:17:24,203 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:17:24,203 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 01:17:24,236 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/bin-2019/uautomizer/data/1752a1a94/fe709e4e90d84da29cc4f7eae6b75275/FLAGf0852a29f [2018-12-09 01:17:24,551 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:17:24,551 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 01:17:24,554 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/bin-2019/uautomizer/data/1752a1a94/fe709e4e90d84da29cc4f7eae6b75275/FLAGf0852a29f [2018-12-09 01:17:24,964 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/bin-2019/uautomizer/data/1752a1a94/fe709e4e90d84da29cc4f7eae6b75275 [2018-12-09 01:17:24,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:17:24,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:17:24,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:17:24,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:17:24,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:17:24,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:17:24" (1/1) ... [2018-12-09 01:17:24,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c93d57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:24, skipping insertion in model container [2018-12-09 01:17:24,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:17:24" (1/1) ... [2018-12-09 01:17:24,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:17:24,985 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:17:25,075 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:17:25,081 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:17:25,091 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:17:25,099 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:17:25,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25 WrapperNode [2018-12-09 01:17:25,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:17:25,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:17:25,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:17:25,100 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:17:25,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... [2018-12-09 01:17:25,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... [2018-12-09 01:17:25,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:17:25,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:17:25,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:17:25,129 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:17:25,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... [2018-12-09 01:17:25,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... [2018-12-09 01:17:25,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... [2018-12-09 01:17:25,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... [2018-12-09 01:17:25,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... [2018-12-09 01:17:25,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... [2018-12-09 01:17:25,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... [2018-12-09 01:17:25,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:17:25,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:17:25,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:17:25,145 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:17:25,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/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-09 01:17:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:17:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:17:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:17:25,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:17:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:17:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:17:25,328 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:17:25,328 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 01:17:25,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:17:25 BoogieIcfgContainer [2018-12-09 01:17:25,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:17:25,329 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 01:17:25,329 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 01:17:25,333 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 01:17:25,333 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:17:25,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 01:17:24" (1/3) ... [2018-12-09 01:17:25,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6efddd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:17:25, skipping insertion in model container [2018-12-09 01:17:25,335 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:17:25,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:25" (2/3) ... [2018-12-09 01:17:25,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6efddd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:17:25, skipping insertion in model container [2018-12-09 01:17:25,335 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:17:25,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:17:25" (3/3) ... [2018-12-09 01:17:25,336 INFO L375 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 01:17:25,380 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:17:25,381 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 01:17:25,381 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 01:17:25,381 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 01:17:25,381 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:17:25,381 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:17:25,381 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 01:17:25,381 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:17:25,381 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 01:17:25,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-09 01:17:25,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:17:25,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:25,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:25,407 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:17:25,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 01:17:25,407 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 01:17:25,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-09 01:17:25,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:17:25,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:25,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:25,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:17:25,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 01:17:25,413 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-09 01:17:25,414 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-09 01:17:25,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 01:17:25,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:25,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:25,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-12-09 01:17:25,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:25,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:25,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:25,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:25,520 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-12-09 01:17:25,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:25,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:25,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:25,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:25,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:25,955 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-12-09 01:17:26,083 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-12-09 01:17:26,090 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:17:26,091 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:17:26,091 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:17:26,091 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:17:26,091 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:17:26,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:17:26,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:17:26,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:17:26,092 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Lasso [2018-12-09 01:17:26,092 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:17:26,092 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:17:26,107 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-09 01:17:26,110 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-09 01:17:26,113 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-09 01:17:26,114 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-09 01:17:26,405 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-12-09 01:17:26,478 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-09 01:17:26,480 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-09 01:17:26,481 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-09 01:17:26,482 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-09 01:17:26,483 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-09 01:17:26,764 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:17:26,768 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:17:26,769 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-09 01:17:26,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:26,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:26,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:26,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,774 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-09 01:17:26,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:17:26,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:26,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:26,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:26,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,781 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-09 01:17:26,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,817 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-09 01:17:26,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,818 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:17:26,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,819 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:17:26,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:17:26,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,825 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:17:26,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,826 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:17:26,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:17:26,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,837 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-09 01:17:26,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,840 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-09 01:17:26,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,844 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-09 01:17:26,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,845 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:17:26,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,846 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:17:26,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,851 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-09 01:17:26,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,854 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-09 01:17:26,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:17:26,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,862 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-09 01:17:26,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,867 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-09 01:17:26,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,868 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:17:26,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,869 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:17:26,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,872 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-09 01:17:26,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,877 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-09 01:17:26,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,882 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-09 01:17:26,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:26,885 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-09 01:17:26,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:26,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:26,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:26,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:26,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:26,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:26,890 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:17:26,894 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 01:17:26,894 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 01:17:26,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:17:26,896 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:17:26,896 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:17:26,897 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-09 01:17:26,984 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-12-09 01:17:26,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:17:27,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:27,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:27,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:27,047 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-09 01:17:27,059 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-09 01:17:27,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2018-12-09 01:17:27,095 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-09 01:17:27,095 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-09 01:17:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 01:17:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-12-09 01:17:27,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-12-09 01:17:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-09 01:17:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-09 01:17:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:27,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2018-12-09 01:17:27,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:17:27,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2018-12-09 01:17:27,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-09 01:17:27,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 01:17:27,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2018-12-09 01:17:27,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:17:27,104 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-09 01:17:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2018-12-09 01:17:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-09 01:17:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 01:17:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-12-09 01:17:27,122 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-09 01:17:27,122 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-09 01:17:27,122 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 01:17:27,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-12-09 01:17:27,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:17:27,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:27,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:27,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 01:17:27,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 01:17:27,123 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-09 01:17:27,123 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-09 01:17:27,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:27,123 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-09 01:17:27,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:27,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:27,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:27,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:27,216 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-09 01:17:27,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:17:27,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:17:27,218 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 01:17:27,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2018-12-09 01:17:27,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:27,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:27,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:27,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:17:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:17:27,278 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-09 01:17:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:17:27,334 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-09 01:17:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:17:27,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-12-09 01:17:27,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:17:27,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2018-12-09 01:17:27,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 01:17:27,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 01:17:27,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-09 01:17:27,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:17:27,336 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-09 01:17:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-09 01:17:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-09 01:17:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 01:17:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-09 01:17:27,337 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 01:17:27,337 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 01:17:27,338 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 01:17:27,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-09 01:17:27,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:17:27,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:27,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:27,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-09 01:17:27,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 01:17:27,339 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-09 01:17:27,339 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-09 01:17:27,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-12-09 01:17:27,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:27,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:27,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:27,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2018-12-09 01:17:27,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:27,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:27,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:27,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2018-12-09 01:17:27,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:27,415 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-09 01:17:27,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:17:27,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/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-09 01:17:27,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:27,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:27,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:27,466 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-09 01:17:27,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:27,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:27,480 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-09 01:17:27,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,488 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-09 01:17:27,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-12-09 01:17:27,492 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-09 01:17:27,494 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-09 01:17:27,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-09 01:17:27,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:27,524 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-09 01:17:27,526 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-09 01:17:27,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-12-09 01:17:27,548 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-09 01:17:27,549 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-09 01:17:27,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,556 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-09 01:17:27,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2018-12-09 01:17:27,569 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-09 01:17:27,571 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-09 01:17:27,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,575 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-09 01:17:27,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:27,578 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-09 01:17:27,578 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-12-09 01:17:27,582 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-09 01:17:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:17:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-09 01:17:27,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:17:27,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:17:27,658 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 11 states. [2018-12-09 01:17:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:17:27,760 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-09 01:17:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:17:27,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-12-09 01:17:27,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 01:17:27,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-12-09 01:17:27,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 01:17:27,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-09 01:17:27,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-12-09 01:17:27,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:17:27,762 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-09 01:17:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-12-09 01:17:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-12-09 01:17:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 01:17:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-09 01:17:27,763 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-09 01:17:27,764 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-09 01:17:27,764 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 01:17:27,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-12-09 01:17:27,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 01:17:27,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:27,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:27,764 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:17:27,765 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-12-09 01:17:27,765 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-09 01:17:27,765 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-09 01:17:27,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:27,765 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-09 01:17:27,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:27,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:27,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:27,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:27,776 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2018-12-09 01:17:27,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:27,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:27,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:27,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2018-12-09 01:17:27,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:27,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:27,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:27,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:28,208 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-12-09 01:17:28,332 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-12-09 01:17:28,334 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:17:28,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:17:28,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:17:28,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:17:28,335 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:17:28,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:17:28,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:17:28,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:17:28,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2018-12-09 01:17:28,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:17:28,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:17:28,337 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-09 01:17:28,339 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-09 01:17:28,340 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-09 01:17:28,601 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-12-09 01:17:28,685 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-09 01:17:28,687 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-09 01:17:28,688 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-09 01:17:28,701 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-09 01:17:28,702 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-09 01:17:28,703 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-09 01:17:28,704 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-09 01:17:28,982 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:17:28,982 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:17:28,982 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-09 01:17:28,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:28,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:28,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:28,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:28,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:28,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:28,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:28,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-09 01:17:28,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:28,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:28,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:28,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:28,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:28,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:28,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:28,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:28,986 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-09 01:17:28,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:28,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:28,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:28,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:28,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:28,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:28,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:28,989 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-09 01:17:28,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:28,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:28,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:28,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:28,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:28,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:28,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:28,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-09 01:17:28,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:28,992 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:17:28,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:28,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:28,993 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:17:28,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:28,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:28,995 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-09 01:17:28,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:28,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:28,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:28,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:28,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:28,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:28,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:28,997 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-09 01:17:28,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:28,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:28,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:28,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:28,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:28,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:29,000 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:17:29,002 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 01:17:29,002 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 01:17:29,002 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:17:29,003 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:17:29,003 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:17:29,003 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-09 01:17:29,088 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-12-09 01:17:29,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:17:29,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:29,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:29,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:29,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,132 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-09 01:17:29,136 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-09 01:17:29,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,162 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-09 01:17:29,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-09 01:17:29,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:17:29,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:17:29,193 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-12-09 01:17:29,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,217 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-09 01:17:29,219 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-09 01:17:29,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,242 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-09 01:17:29,246 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-09 01:17:29,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,272 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-09 01:17:29,275 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-09 01:17:29,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,283 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,296 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-09 01:17:29,296 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-12-09 01:17:29,325 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-09 01:17:29,325 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-09 01:17:29,326 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-12-09 01:17:29,400 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-09 01:17:29,400 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-09 01:17:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 01:17:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-09 01:17:29,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-12-09 01:17:29,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:29,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-12-09 01:17:29,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:29,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-12-09 01:17:29,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:29,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-12-09 01:17:29,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 01:17:29,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-12-09 01:17:29,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 01:17:29,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 01:17:29,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-12-09 01:17:29,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:17:29,403 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-09 01:17:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-12-09 01:17:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-09 01:17:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 01:17:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-12-09 01:17:29,405 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-09 01:17:29,405 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-09 01:17:29,405 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 01:17:29,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-12-09 01:17:29,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 01:17:29,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:29,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:29,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-09 01:17:29,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 01:17:29,406 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-09 01:17:29,406 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-09 01:17:29,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2018-12-09 01:17:29,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:29,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:29,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:29,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:29,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:29,525 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-09 01:17:29,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:17:29,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/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-09 01:17:29,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:29,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:29,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,564 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-09 01:17:29,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,580 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-09 01:17:29,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,600 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-09 01:17:29,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,639 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-09 01:17:29,642 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-09 01:17:29,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,653 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-09 01:17:29,655 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-09 01:17:29,655 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,667 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-09 01:17:29,669 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-09 01:17:29,669 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,684 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-09 01:17:29,686 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-09 01:17:29,686 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,694 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,699 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-09 01:17:29,703 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-09 01:17:29,707 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-09 01:17:29,717 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-09 01:17:29,717 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:157, output treesize:53 [2018-12-09 01:17:29,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:29,743 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-09 01:17:29,745 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-09 01:17:29,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,769 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-09 01:17:29,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:53 [2018-12-09 01:17:29,840 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-09 01:17:29,842 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-09 01:17:29,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,851 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-09 01:17:29,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,856 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-09 01:17:29,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,859 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-09 01:17:29,859 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:29,866 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-09 01:17:29,866 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:76, output treesize:3 [2018-12-09 01:17:29,873 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-09 01:17:29,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:17:29,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-12-09 01:17:29,888 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 01:17:29,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2018-12-09 01:17:29,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:29,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:29,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:29,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:29,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:29,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:17:29,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:17:29,977 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-12-09 01:17:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:17:30,168 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-09 01:17:30,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:17:30,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2018-12-09 01:17:30,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 01:17:30,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-12-09 01:17:30,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-09 01:17:30,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-09 01:17:30,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-12-09 01:17:30,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:17:30,169 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-09 01:17:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-12-09 01:17:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-09 01:17:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 01:17:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-09 01:17:30,171 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-09 01:17:30,171 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-09 01:17:30,171 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 01:17:30,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-09 01:17:30,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 01:17:30,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:30,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:30,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-12-09 01:17:30,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 01:17:30,172 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-09 01:17:30,172 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-09 01:17:30,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2018-12-09 01:17:30,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:30,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:30,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:30,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:30,200 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2018-12-09 01:17:30,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:30,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:30,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:30,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:30,208 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2018-12-09 01:17:30,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:30,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:30,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:30,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:30,293 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-09 01:17:30,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:17:30,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/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-09 01:17:30,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:30,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:30,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:30,330 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-09 01:17:30,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:30,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:30,346 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-09 01:17:30,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-09 01:17:30,361 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-09 01:17:30,362 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-09 01:17:30,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-09 01:17:30,380 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-09 01:17:30,382 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-09 01:17:30,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-12-09 01:17:30,409 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-09 01:17:30,410 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-09 01:17:30,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-09 01:17:30,431 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-09 01:17:30,433 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-09 01:17:30,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,443 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-09 01:17:30,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-12-09 01:17:30,470 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-09 01:17:30,472 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-09 01:17:30,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,476 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-09 01:17:30,476 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:30,480 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-09 01:17:30,480 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2018-12-09 01:17:30,486 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-09 01:17:30,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:17:30,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-12-09 01:17:30,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 01:17:30,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:17:30,595 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 14 states. [2018-12-09 01:17:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:17:30,868 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-09 01:17:30,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 01:17:30,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions. [2018-12-09 01:17:30,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-12-09 01:17:30,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 44 transitions. [2018-12-09 01:17:30,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 01:17:30,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-09 01:17:30,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2018-12-09 01:17:30,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:17:30,869 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-09 01:17:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2018-12-09 01:17:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-12-09 01:17:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 01:17:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-09 01:17:30,871 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-09 01:17:30,871 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-09 01:17:30,871 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 01:17:30,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2018-12-09 01:17:30,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-12-09 01:17:30,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:30,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:30,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-12-09 01:17:30,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 01:17:30,872 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-09 01:17:30,872 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-09 01:17:30,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:30,872 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2018-12-09 01:17:30,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:30,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:30,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:30,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 53784836, now seen corresponding path program 1 times [2018-12-09 01:17:30,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:30,915 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-09 01:17:30,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:17:30,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:17:30,916 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:17:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:17:30,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:17:30,916 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-09 01:17:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:17:30,932 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-12-09 01:17:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:17:30,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-12-09 01:17:30,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 01:17:30,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2018-12-09 01:17:30,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 01:17:30,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-09 01:17:30,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2018-12-09 01:17:30,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:17:30,933 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-09 01:17:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2018-12-09 01:17:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-09 01:17:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 01:17:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-09 01:17:30,935 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-09 01:17:30,935 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-09 01:17:30,935 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 01:17:30,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2018-12-09 01:17:30,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 01:17:30,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:30,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:30,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-12-09 01:17:30,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2018-12-09 01:17:30,936 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-09 01:17:30,937 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-09 01:17:30,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:30,937 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2018-12-09 01:17:30,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:30,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:30,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:30,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2018-12-09 01:17:30,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:30,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2018-12-09 01:17:30,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:30,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:30,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:17:30,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:31,436 WARN L180 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2018-12-09 01:17:31,567 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-09 01:17:33,681 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 189 DAG size of output: 159 [2018-12-09 01:17:34,112 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-12-09 01:17:34,115 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:17:34,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:17:34,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:17:34,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:17:34,115 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:17:34,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:17:34,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:17:34,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:17:34,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Lasso [2018-12-09 01:17:34,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:17:34,115 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:17:34,117 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-09 01:17:34,118 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-09 01:17:34,119 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-09 01:17:34,120 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-09 01:17:34,534 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2018-12-09 01:17:34,645 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-12-09 01:17:34,646 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-09 01:17:34,647 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-09 01:17:34,648 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-09 01:17:34,649 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-09 01:17:34,650 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-09 01:17:34,943 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:17:34,943 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:17:34,944 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-09 01:17:34,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:34,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:34,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:34,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,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-09 01:17:34,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:34,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,948 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-09 01:17:34,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:34,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:34,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:34,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,949 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-09 01:17:34,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,950 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:17:34,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,950 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:17:34,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,953 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-09 01:17:34,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,953 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:17:34,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,953 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:17:34,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,956 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-09 01:17:34,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,957 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:17:34,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,958 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:17:34,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,960 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-09 01:17:34,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:34,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,963 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-09 01:17:34,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:34,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,966 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-09 01:17:34,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:34,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,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-09 01:17:34,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,979 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:17:34,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,981 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:17:34,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,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-09 01:17:34,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:34,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,988 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-09 01:17:34,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:34,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,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-09 01:17:34,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:34,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:34,994 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-09 01:17:34,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:34,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:34,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:34,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:34,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:34,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:34,999 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:17:35,003 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 01:17:35,003 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 01:17:35,003 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:17:35,004 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:17:35,004 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:17:35,004 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-09 01:17:35,141 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2018-12-09 01:17:35,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:35,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:35,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:35,179 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-09 01:17:35,180 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-09 01:17:35,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,188 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-09 01:17:35,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-12-09 01:17:35,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,214 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-09 01:17:35,216 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-09 01:17:35,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,230 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-09 01:17:35,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:17:35,249 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-09 01:17:35,249 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:62 [2018-12-09 01:17:35,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,276 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-09 01:17:35,278 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-09 01:17:35,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,307 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-09 01:17:35,310 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-09 01:17:35,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,333 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-09 01:17:35,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:72 [2018-12-09 01:17:35,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,387 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-09 01:17:35,396 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-09 01:17:35,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:17:35,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,478 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-09 01:17:35,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,518 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-09 01:17:35,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,553 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-09 01:17:35,554 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 01:17:35,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 01:17:35,617 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-09 01:17:35,618 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:43, output treesize:149 [2018-12-09 01:17:35,674 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:17:35,676 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-09 01:17:35,678 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-09 01:17:35,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,757 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-09 01:17:35,761 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-09 01:17:35,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,903 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-09 01:17:35,903 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:35,947 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-09 01:17:35,948 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:35,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:17:36,057 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:17:36,057 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-09 01:17:36,059 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-09 01:17:36,059 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:36,066 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:36,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:36,133 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-09 01:17:36,135 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-09 01:17:36,136 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:36,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:36,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:36,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:36,163 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-09 01:17:36,164 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:36,189 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:17:36,262 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-09 01:17:36,262 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:193, output treesize:297 [2018-12-09 01:17:36,419 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2018-12-09 01:17:36,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:36,437 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-09 01:17:36,439 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-09 01:17:36,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:36,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:36,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:36,514 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-09 01:17:36,516 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-09 01:17:36,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:36,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:36,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:36,568 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-09 01:17:36,575 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-09 01:17:36,575 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 01:17:36,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:17:36,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:36,648 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-09 01:17:36,650 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-09 01:17:36,650 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:36,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:36,679 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-09 01:17:36,679 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 01:17:36,697 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:17:36,747 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-09 01:17:36,747 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:216 [2018-12-09 01:17:36,910 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2018-12-09 01:17:36,911 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-09 01:17:36,911 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-09 01:17:36,911 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-12-09 01:17:37,376 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-09 01:17:37,376 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-09 01:17:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 01:17:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-12-09 01:17:37,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 15 letters. [2018-12-09 01:17:37,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:37,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 31 letters. Loop has 15 letters. [2018-12-09 01:17:37,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:37,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 30 letters. [2018-12-09 01:17:37,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:37,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2018-12-09 01:17:37,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 01:17:37,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2018-12-09 01:17:37,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 01:17:37,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-09 01:17:37,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2018-12-09 01:17:37,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:17:37,380 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-12-09 01:17:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2018-12-09 01:17:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-12-09 01:17:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 01:17:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-09 01:17:37,382 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 01:17:37,382 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 01:17:37,382 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 01:17:37,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2018-12-09 01:17:37,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 01:17:37,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:37,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:37,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 01:17:37,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-12-09 01:17:37,383 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-09 01:17:37,383 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-09 01:17:37,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2018-12-09 01:17:37,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:37,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:37,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:37,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:37,398 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2018-12-09 01:17:37,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:37,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:37,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:37,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:37,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:37,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2018-12-09 01:17:37,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:37,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:37,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:37,531 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-12-09 01:17:39,555 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 194 DAG size of output: 155 [2018-12-09 01:17:39,952 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-09 01:17:39,955 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:17:39,955 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:17:39,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:17:39,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:17:39,955 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:17:39,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:17:39,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:17:39,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:17:39,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Lasso [2018-12-09 01:17:39,955 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:17:39,955 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:17:39,957 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-09 01:17:39,958 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-09 01:17:39,960 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-09 01:17:39,961 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-09 01:17:39,962 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-09 01:17:39,963 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-09 01:17:39,964 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-09 01:17:39,965 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-09 01:17:40,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:17:40,637 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:17:40,637 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-09 01:17:40,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:40,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:40,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:40,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:40,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:40,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:40,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:40,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:40,638 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-09 01:17:40,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:40,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:40,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:40,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:40,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:40,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:40,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:40,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-09 01:17:40,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:40,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:40,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:40,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:40,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:40,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:40,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:40,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:40,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-09 01:17:40,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:40,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:40,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:40,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:40,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:40,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:40,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:40,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-09 01:17:40,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:40,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:40,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:40,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:40,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:40,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:40,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:40,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:40,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-09 01:17:40,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:40,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:40,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:40,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:40,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:40,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:40,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:40,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:40,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-09 01:17:40,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:40,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:17:40,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:40,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:40,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:40,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:17:40,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:17:40,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:17:40,646 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-09 01:17:40,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:17:40,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:17:40,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:17:40,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:17:40,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:17:40,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:17:40,648 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:17:40,650 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 01:17:40,650 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 01:17:40,651 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:17:40,651 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:17:40,651 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:17:40,651 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-09 01:17:40,740 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-12-09 01:17:40,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 01:17:40,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:40,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:40,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:40,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:40,783 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-09 01:17:40,793 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-09 01:17:40,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-09 01:17:40,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:40,820 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-09 01:17:40,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:40,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:17:40,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:17:40,849 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-12-09 01:17:40,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:40,888 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-09 01:17:40,892 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-09 01:17:40,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:40,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:40,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:40,919 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-09 01:17:40,920 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-09 01:17:40,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:40,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:40,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:40,941 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-09 01:17:40,942 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-09 01:17:40,942 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:40,945 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:40,958 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-09 01:17:40,958 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-12-09 01:17:40,986 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-09 01:17:40,986 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-09 01:17:40,986 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-12-09 01:17:41,058 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-09 01:17:41,058 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-09 01:17:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 01:17:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-12-09 01:17:41,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2018-12-09 01:17:41,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:41,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2018-12-09 01:17:41,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:41,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2018-12-09 01:17:41,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:17:41,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2018-12-09 01:17:41,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 01:17:41,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 63 transitions. [2018-12-09 01:17:41,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 01:17:41,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 01:17:41,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2018-12-09 01:17:41,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:17:41,060 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-12-09 01:17:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2018-12-09 01:17:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-12-09 01:17:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 01:17:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-12-09 01:17:41,062 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-12-09 01:17:41,062 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-12-09 01:17:41,062 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 01:17:41,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2018-12-09 01:17:41,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 01:17:41,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:17:41,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:17:41,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2018-12-09 01:17:41,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2018-12-09 01:17:41,063 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-09 01:17:41,063 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-09 01:17:41,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:41,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2018-12-09 01:17:41,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:41,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:41,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:41,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:41,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:17:41,188 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-09 01:17:41,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:17:41,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e75755d-e04b-43f3-9157-ab2b5744530d/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-09 01:17:41,195 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 01:17:41,232 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-12-09 01:17:41,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:17:41,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:17:41,237 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-09 01:17:41,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,252 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-09 01:17:41,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:9 [2018-12-09 01:17:41,265 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-09 01:17:41,267 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-09 01:17:41,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 01:17:41,292 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-09 01:17:41,294 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-09 01:17:41,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-09 01:17:41,313 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-09 01:17:41,314 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-09 01:17:41,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 01:17:41,332 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-09 01:17:41,333 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-09 01:17:41,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 01:17:41,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,361 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-09 01:17:41,363 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-09 01:17:41,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2018-12-09 01:17:41,401 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-09 01:17:41,403 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-09 01:17:41,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,426 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-09 01:17:41,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:17:41,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:17:41,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:17:41,449 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:60 [2018-12-09 01:17:41,484 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:17:41,486 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-09 01:17:41,487 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-09 01:17:41,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,525 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-09 01:17:41,528 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-09 01:17:41,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,554 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-09 01:17:41,554 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:17:41,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:17:41,584 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:78, output treesize:60 [2018-12-09 01:17:41,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,622 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-09 01:17:41,624 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-09 01:17:41,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,650 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-09 01:17:41,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:17:41,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:17:41,678 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-09 01:17:41,678 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:50 [2018-12-09 01:17:41,733 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-09 01:17:41,735 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-09 01:17:41,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:17:41,750 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-09 01:17:41,750 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,762 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-09 01:17:41,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,773 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-09 01:17:41,773 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,784 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-09 01:17:41,784 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:17:41,807 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-09 01:17:41,808 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-09 01:17:41,809 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,813 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-09 01:17:41,813 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,815 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:17:41,821 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-09 01:17:41,821 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:80, output treesize:3 [2018-12-09 01:17:41,831 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-09 01:17:41,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:17:41,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2018-12-09 01:17:41,846 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 01:17:41,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:17:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2018-12-09 01:17:41,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:17:41,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:17:41,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:41,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:17:41,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:17:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:17:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 01:17:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-12-09 01:17:41,967 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-12-09 01:17:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:17:42,151 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-12-09 01:17:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 01:17:42,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 39 transitions. [2018-12-09 01:17:42,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 01:17:42,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2018-12-09 01:17:42,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 01:17:42,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 01:17:42,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 01:17:42,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:17:42,151 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:17:42,151 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:17:42,151 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:17:42,151 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 01:17:42,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:17:42,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 01:17:42,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 01:17:42,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 01:17:42 BoogieIcfgContainer [2018-12-09 01:17:42,156 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 01:17:42,156 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:17:42,156 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:17:42,156 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:17:42,156 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:17:25" (3/4) ... [2018-12-09 01:17:42,158 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 01:17:42,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:17:42,159 INFO L168 Benchmark]: Toolchain (without parser) took 17193.25 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 434.6 MB). Free memory was 956.0 MB in the beginning and 930.7 MB in the end (delta: 25.2 MB). Peak memory consumption was 459.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:17:42,159 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:17:42,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.68 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:17:42,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.36 ms. Allocated memory is still 1.0 GB. Free memory is still 945.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:17:42,160 INFO L168 Benchmark]: Boogie Preprocessor took 15.30 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:17:42,160 INFO L168 Benchmark]: RCFGBuilder took 184.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:17:42,160 INFO L168 Benchmark]: BuchiAutomizer took 16826.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.1 GB in the beginning and 930.7 MB in the end (delta: 188.4 MB). Peak memory consumption was 484.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:17:42,160 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.5 GB. Free memory is still 930.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:17:42,161 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 132.68 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.36 ms. Allocated memory is still 1.0 GB. Free memory is still 945.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.30 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16826.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.1 GB in the beginning and 930.7 MB in the end (delta: 188.4 MB). Peak memory consumption was 484.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.5 GB. Free memory is still 930.7 MB. 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...