./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/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 32bit --witnessprinter.graph.data.programhash dc8491de7bb3fbae410adb8e5711b9887b8c9c8f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:14:03,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:14:03,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:14:03,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:14:03,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:14:03,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:14:03,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:14:03,145 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:14:03,146 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:14:03,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:14:03,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:14:03,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:14:03,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:14:03,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:14:03,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:14:03,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:14:03,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:14:03,152 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:14:03,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:14:03,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:14:03,156 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:14:03,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:14:03,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:14:03,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:14:03,159 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:14:03,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:14:03,160 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:14:03,161 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:14:03,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:14:03,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:14:03,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:14:03,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:14:03,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:14:03,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:14:03,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:14:03,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:14:03,164 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 13:14:03,175 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:14:03,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:14:03,176 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:14:03,176 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:14:03,176 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:14:03,176 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:14:03,176 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:14:03,176 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:14:03,176 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:14:03,177 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:14:03,177 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:14:03,177 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:14:03,177 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:14:03,177 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:14:03,177 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:14:03,177 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:14:03,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:14:03,178 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:14:03,178 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:14:03,178 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:14:03,178 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:14:03,178 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:14:03,178 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:14:03,178 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:14:03,178 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:14:03,179 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:14:03,179 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:14:03,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:14:03,179 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:14:03,179 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:14:03,179 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:14:03,180 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_e08978b4-a2a2-4b99-9045-4d5942f6d368/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc8491de7bb3fbae410adb8e5711b9887b8c9c8f [2018-11-10 13:14:03,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:14:03,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:14:03,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:14:03,215 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:14:03,216 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:14:03,216 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-11-10 13:14:03,250 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/data/fdec41a08/c1afa82e1c65441699e18c5f2b23d301/FLAG1ddefb57e [2018-11-10 13:14:03,581 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:14:03,582 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-11-10 13:14:03,590 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/data/fdec41a08/c1afa82e1c65441699e18c5f2b23d301/FLAG1ddefb57e [2018-11-10 13:14:03,598 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/data/fdec41a08/c1afa82e1c65441699e18c5f2b23d301 [2018-11-10 13:14:03,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:14:03,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:14:03,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:14:03,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:14:03,604 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:14:03,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6604a2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03, skipping insertion in model container [2018-11-10 13:14:03,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:14:03,635 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:14:03,800 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:14:03,807 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:14:03,833 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:14:03,862 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:14:03,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03 WrapperNode [2018-11-10 13:14:03,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:14:03,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:14:03,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:14:03,863 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:14:03,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:14:03,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:14:03,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:14:03,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:14:03,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... [2018-11-10 13:14:03,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:14:03,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:14:03,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:14:03,949 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:14:03,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:14:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:14:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:14:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:14:03,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:14:04,180 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:14:04,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:14:04 BoogieIcfgContainer [2018-11-10 13:14:04,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:14:04,181 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:14:04,181 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:14:04,185 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:14:04,185 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:14:04,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:14:03" (1/3) ... [2018-11-10 13:14:04,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64e351ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:14:04, skipping insertion in model container [2018-11-10 13:14:04,187 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:14:04,187 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:03" (2/3) ... [2018-11-10 13:14:04,187 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64e351ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:14:04, skipping insertion in model container [2018-11-10 13:14:04,187 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:14:04,187 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:14:04" (3/3) ... [2018-11-10 13:14:04,189 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-11-10 13:14:04,236 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:14:04,237 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:14:04,237 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:14:04,237 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:14:04,237 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:14:04,237 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:14:04,238 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:14:04,238 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:14:04,238 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:14:04,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 13:14:04,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:14:04,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:14:04,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:14:04,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:14:04,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:04,276 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:14:04,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 13:14:04,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:14:04,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:14:04,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:14:04,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:14:04,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:04,284 INFO L793 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 27#L560true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15#L560-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 21#L544-3true [2018-11-10 13:14:04,285 INFO L795 eck$LassoCheckResult]: Loop: 21#L544-3true assume true; 8#L544-1true assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 5#L546true SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 6#L546-1true assume test_fun_#t~mem3 == 0;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 14#L551-3true assume !true; 17#L551-4true SUMMARY for call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551-4 7#L555true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 21#L544-3true [2018-11-10 13:14:04,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:04,290 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 13:14:04,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:04,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:04,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:04,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:04,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash 929032042, now seen corresponding path program 1 times [2018-11-10 13:14:04,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:04,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:04,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:04,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:04,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:14:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:14:04,410 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:14:04,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:14:04,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:14:04,420 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-10 13:14:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:04,425 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-10 13:14:04,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:14:04,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-11-10 13:14:04,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:14:04,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 25 transitions. [2018-11-10 13:14:04,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 13:14:04,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 13:14:04,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-11-10 13:14:04,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:14:04,431 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 13:14:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-11-10 13:14:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 13:14:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 13:14:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-10 13:14:04,454 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 13:14:04,454 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 13:14:04,454 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:14:04,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-10 13:14:04,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:14:04,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:14:04,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:14:04,455 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:14:04,455 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:04,455 INFO L793 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 69#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 70#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 62#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 63#L544-3 [2018-11-10 13:14:04,456 INFO L795 eck$LassoCheckResult]: Loop: 63#L544-3 assume true; 68#L544-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 66#L546 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 67#L546-1 assume test_fun_#t~mem3 == 0;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 58#L551-3 assume true; 59#L551 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 77#L551-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 64#L551-4 SUMMARY for call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551-4 65#L555 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 63#L544-3 [2018-11-10 13:14:04,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 13:14:04,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:04,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:04,472 INFO L82 PathProgramCache]: Analyzing trace with hash -567716706, now seen corresponding path program 1 times [2018-11-10 13:14:04,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:04,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:04,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:14:04,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:04,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2080975558, now seen corresponding path program 1 times [2018-11-10 13:14:04,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:04,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:04,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:04,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:04,793 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:14:04,794 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:14:04,794 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:14:04,794 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:14:04,794 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:14:04,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:14:04,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:14:04,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:14:04,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 13:14:04,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:14:04,795 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:14:04,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:04,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:05,213 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:14:05,216 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:14:05,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:05,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:05,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:05,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:05,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:05,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:05,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:05,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:05,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:05,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:05,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:05,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:05,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:05,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:05,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:05,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:05,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:05,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:05,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:05,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:05,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:05,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:05,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:05,244 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:05,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:05,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:05,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:05,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,262 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:14:05,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,266 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:14:05,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:05,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:05,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:05,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:05,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:05,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:05,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:05,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:05,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:05,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:05,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:05,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:05,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:05,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:05,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:05,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:05,341 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:14:05,359 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 13:14:05,359 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 13:14:05,361 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:14:05,363 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:14:05,364 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:14:05,364 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-10 13:14:05,375 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 13:14:05,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:05,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:05,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:05,453 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-11-10 13:14:05,454 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 13:14:05,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 38 states and 46 transitions. Complement of second has 6 states. [2018-11-10 13:14:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 13:14:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:14:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 13:14:05,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-10 13:14:05,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:05,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-10 13:14:05,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:05,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-10 13:14:05,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:05,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2018-11-10 13:14:05,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:14:05,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 44 transitions. [2018-11-10 13:14:05,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 13:14:05,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 13:14:05,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-11-10 13:14:05,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:14:05,493 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-10 13:14:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-11-10 13:14:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-10 13:14:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 13:14:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-10 13:14:05,495 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-10 13:14:05,495 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-10 13:14:05,495 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:14:05,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2018-11-10 13:14:05,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:14:05,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:14:05,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:14:05,496 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:05,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:05,497 INFO L793 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 211#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 199#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 200#L544-3 assume true; 208#L544-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 203#L546 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 204#L546-1 assume test_fun_#t~mem3 == 0;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 191#L551-3 [2018-11-10 13:14:05,497 INFO L795 eck$LassoCheckResult]: Loop: 191#L551-3 assume true; 192#L551 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 223#L551-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 217#L552 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552 218#L552-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 212#L553 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 213#L553-1 test_fun_#t~post8 := test_fun_#t~mem7; 221#L553-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-2 225#L553-3 havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 191#L551-3 [2018-11-10 13:14:05,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash 176673837, now seen corresponding path program 1 times [2018-11-10 13:14:05,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:05,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:05,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:05,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:05,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:05,520 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 1 times [2018-11-10 13:14:05,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:05,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:05,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:05,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,525 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 13:14:05,525 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 13:14:05,526 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 13:14:05,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:05,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1347533539, now seen corresponding path program 1 times [2018-11-10 13:14:05,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:05,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,589 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 13:14:05,589 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 13:14:05,589 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 13:14:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:05,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:05,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-10 13:14:05,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-10 13:14:05,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:14:05,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:05,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:05,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-11-10 13:14:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:05,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:14:05,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:14:05,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:14:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:14:05,822 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-10 13:14:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:05,884 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-10 13:14:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:14:05,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-11-10 13:14:05,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:14:05,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 47 transitions. [2018-11-10 13:14:05,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 13:14:05,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 13:14:05,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2018-11-10 13:14:05,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:14:05,886 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-10 13:14:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2018-11-10 13:14:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-10 13:14:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 13:14:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-10 13:14:05,890 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-10 13:14:05,890 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-10 13:14:05,890 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:14:05,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-10 13:14:05,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:14:05,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:14:05,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:14:05,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:05,891 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:05,891 INFO L793 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 351#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 338#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 339#L544-3 assume true; 348#L544-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 343#L546 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 344#L546-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 330#L548 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L548 331#L548-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 334#L551-3 [2018-11-10 13:14:05,892 INFO L795 eck$LassoCheckResult]: Loop: 334#L551-3 assume true; 335#L551 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 365#L551-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 359#L552 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552 360#L552-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 352#L553 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 353#L553-1 test_fun_#t~post8 := test_fun_#t~mem7; 357#L553-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-2 363#L553-3 havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 334#L551-3 [2018-11-10 13:14:05,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2015131756, now seen corresponding path program 1 times [2018-11-10 13:14:05,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:05,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:05,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:05,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:05,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:05,902 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 2 times [2018-11-10 13:14:05,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:05,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,905 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 13:14:05,905 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 13:14:05,905 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 13:14:05,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 13:14:05,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 13:14:05,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 13:14:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:05,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1403488874, now seen corresponding path program 1 times [2018-11-10 13:14:05,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:05,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:14:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:05,957 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 13:14:05,957 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 13:14:05,957 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 13:14:05,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:06,246 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-10 13:14:06,308 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:14:06,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:14:06,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:14:06,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:14:06,309 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:14:06,309 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:14:06,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:14:06,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:14:06,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-10 13:14:06,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:14:06,309 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:14:06,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,462 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-11-10 13:14:06,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:06,760 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:14:06,760 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:14:06,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:06,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:06,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:06,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:06,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:06,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:06,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:06,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:06,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:06,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:06,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:06,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:06,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:06,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:06,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:06,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:06,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:06,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:06,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:06,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:06,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:06,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:06,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:06,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:06,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:06,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:06,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:06,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:06,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:06,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:06,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:06,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:06,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:06,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:06,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:06,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:06,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:06,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:06,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:06,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:06,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:06,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:06,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:06,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:06,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:06,780 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:14:06,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:06,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:06,786 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:14:06,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:06,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:06,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:06,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:06,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:06,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:06,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:06,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:06,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:06,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:06,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:06,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:06,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:06,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:06,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:06,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:06,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:06,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:06,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:06,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:06,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:06,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:06,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:06,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:06,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:06,822 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:14:06,826 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:14:06,826 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:14:06,827 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:14:06,827 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:14:06,828 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:14:06,828 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_1 Supporting invariants [] [2018-11-10 13:14:06,836 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 13:14:06,838 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:14:06,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:06,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:06,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:06,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:14:06,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 13:14:06,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-11-10 13:14:06,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:14:06,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:06,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:06,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 13:14:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:06,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 13:14:06,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-10 13:14:06,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 112 states and 127 transitions. Complement of second has 13 states. [2018-11-10 13:14:06,973 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-11-10 13:14:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 13:14:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-10 13:14:06,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 10 letters. Loop has 9 letters. [2018-11-10 13:14:06,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:06,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 19 letters. Loop has 9 letters. [2018-11-10 13:14:06,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:06,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 10 letters. Loop has 18 letters. [2018-11-10 13:14:06,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:06,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 127 transitions. [2018-11-10 13:14:06,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 13:14:06,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 87 states and 100 transitions. [2018-11-10 13:14:06,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 13:14:06,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 13:14:06,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 100 transitions. [2018-11-10 13:14:06,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:14:06,977 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-11-10 13:14:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 100 transitions. [2018-11-10 13:14:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2018-11-10 13:14:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 13:14:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2018-11-10 13:14:06,980 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-11-10 13:14:06,980 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-11-10 13:14:06,980 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 13:14:06,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2018-11-10 13:14:06,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:14:06,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:14:06,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:14:06,981 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:06,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:06,981 INFO L793 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 615#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 596#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 597#L544-3 assume true; 610#L544-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 611#L546 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 606#L546-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 592#L548 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L548 593#L548-1 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 588#L551-3 [2018-11-10 13:14:06,981 INFO L795 eck$LassoCheckResult]: Loop: 588#L551-3 assume true; 589#L551 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 632#L551-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 623#L552 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552 624#L552-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 616#L553 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 617#L553-1 test_fun_#t~post8 := test_fun_#t~mem7; 621#L553-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-2 630#L553-3 havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 588#L551-3 [2018-11-10 13:14:06,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2015131758, now seen corresponding path program 1 times [2018-11-10 13:14:06,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:06,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:06,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:06,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 3 times [2018-11-10 13:14:06,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:06,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:06,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:06,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:06,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:06,997 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 13:14:06,997 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 13:14:06,997 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 13:14:07,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:14:07,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 13:14:07,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 13:14:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:07,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:07,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1010461864, now seen corresponding path program 1 times [2018-11-10 13:14:07,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:07,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:07,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:14:07,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:07,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:14:07,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:14:07,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:14:07,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:14:07,102 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-10 13:14:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:07,136 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-10 13:14:07,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:14:07,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 87 transitions. [2018-11-10 13:14:07,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:14:07,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 68 states and 77 transitions. [2018-11-10 13:14:07,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 13:14:07,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 13:14:07,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 77 transitions. [2018-11-10 13:14:07,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:14:07,139 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-11-10 13:14:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 77 transitions. [2018-11-10 13:14:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-11-10 13:14:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 13:14:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-11-10 13:14:07,142 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-10 13:14:07,142 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-10 13:14:07,142 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 13:14:07,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 69 transitions. [2018-11-10 13:14:07,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:14:07,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:14:07,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:14:07,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:07,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:07,143 INFO L793 eck$LassoCheckResult]: Stem: 777#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 771#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 772#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 758#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 759#L544-3 assume true; 784#L544-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 765#L546 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 766#L546-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 756#L548 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L548 757#L548-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 760#L551-3 assume true; 807#L551 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 795#L551-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 794#L551-4 SUMMARY for call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551-4 793#L555 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 792#L544-3 assume true; 768#L544-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 763#L546 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 764#L546-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 754#L548 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L548 755#L548-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 750#L551-3 [2018-11-10 13:14:07,143 INFO L795 eck$LassoCheckResult]: Loop: 750#L551-3 assume true; 751#L551 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 785#L551-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 778#L552 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552 779#L552-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 773#L553 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 774#L553-1 test_fun_#t~post8 := test_fun_#t~mem7; 782#L553-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-2 787#L553-3 havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 750#L551-3 [2018-11-10 13:14:07,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:07,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1359093602, now seen corresponding path program 1 times [2018-11-10 13:14:07,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:07,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:07,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:07,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:07,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:14:07,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:14:07,182 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 13:14:07,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 4 times [2018-11-10 13:14:07,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:07,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:07,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:07,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,185 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 13:14:07,185 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 13:14:07,186 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 13:14:07,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:14:07,207 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:14:07,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 13:14:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:14:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:14:07,263 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-11-10 13:14:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:07,315 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-10 13:14:07,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:14:07,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 101 transitions. [2018-11-10 13:14:07,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:14:07,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 91 states and 99 transitions. [2018-11-10 13:14:07,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 13:14:07,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 13:14:07,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 99 transitions. [2018-11-10 13:14:07,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:14:07,319 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-10 13:14:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 99 transitions. [2018-11-10 13:14:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2018-11-10 13:14:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 13:14:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-11-10 13:14:07,323 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-10 13:14:07,323 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-10 13:14:07,323 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 13:14:07,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 70 transitions. [2018-11-10 13:14:07,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 13:14:07,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:14:07,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:14:07,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:07,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:07,325 INFO L793 eck$LassoCheckResult]: Stem: 944#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 938#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 939#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 923#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 924#L544-3 assume true; 936#L544-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 937#L546 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 965#L546-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 966#L548 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L548 967#L548-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 917#L551-3 assume true; 918#L551 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 955#L551-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 973#L552 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552 972#L552-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 971#L553 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 950#L553-1 test_fun_#t~post8 := test_fun_#t~mem7; 951#L553-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-2 953#L553-3 havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 925#L551-3 assume true; 969#L551 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 968#L551-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 927#L551-4 SUMMARY for call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551-4 928#L555 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 959#L544-3 assume true; 935#L544-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1; 929#L546 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 930#L546-1 assume !(test_fun_#t~mem3 == 0);havoc test_fun_#t~mem3; 919#L548 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L548 920#L548-1 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 915#L551-3 [2018-11-10 13:14:07,325 INFO L795 eck$LassoCheckResult]: Loop: 915#L551-3 assume true; 916#L551 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L551 954#L551-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 945#L552 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L552 946#L552-1 test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6; 940#L553 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553 941#L553-1 test_fun_#t~post8 := test_fun_#t~mem7; 949#L553-2 SUMMARY for call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L553-2 952#L553-3 havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 915#L551-3 [2018-11-10 13:14:07,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:07,325 INFO L82 PathProgramCache]: Analyzing trace with hash -751846368, now seen corresponding path program 1 times [2018-11-10 13:14:07,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:07,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:14:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,329 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 13:14:07,330 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 13:14:07,330 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 13:14:07,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:07,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash 67643337, now seen corresponding path program 5 times [2018-11-10 13:14:07,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:07,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,390 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 13:14:07,390 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 13:14:07,390 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 13:14:07,402 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 13:14:07,407 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 13:14:07,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 13:14:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:07,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash -642736502, now seen corresponding path program 2 times [2018-11-10 13:14:07,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:14:07,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:14:07,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:14:07,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:07,431 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 13:14:07,431 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 13:14:07,431 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e08978b4-a2a2-4b99-9045-4d5942f6d368/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 13:14:07,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 13:14:07,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 13:14:07,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 13:14:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:14:07,764 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2018-11-10 13:14:07,821 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:14:07,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:14:07,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:14:07,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:14:07,822 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:14:07,822 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:14:07,822 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:14:07,822 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:14:07,822 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-10 13:14:07,822 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:14:07,822 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:14:07,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,957 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-11-10 13:14:07,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:07,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:14:08,201 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:14:08,201 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:14:08,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:08,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:08,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:14:08,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:08,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:08,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:08,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:14:08,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:14:08,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:08,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:08,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:08,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:08,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:08,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:08,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:08,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:08,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:14:08,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:14:08,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:14:08,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:14:08,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:14:08,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:14:08,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:14:08,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:14:08,212 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:14:08,214 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:14:08,214 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:14:08,215 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:14:08,215 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:14:08,215 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:14:08,215 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-10 13:14:08,235 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 13:14:08,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:14:08,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:08,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:08,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:08,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:14:08,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 13:14:08,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-11-10 13:14:08,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:14:08,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:08,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:08,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 13:14:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:08,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 13:14:08,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-10 13:14:08,376 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12. Second operand 8 states. Result 79 states and 88 transitions. Complement of second has 13 states. [2018-11-10 13:14:08,377 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-11-10 13:14:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 13:14:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-10 13:14:08,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-10 13:14:08,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:08,378 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 13:14:08,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:08,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:08,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:08,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:14:08,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 13:14:08,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-11-10 13:14:08,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:14:08,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:08,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:08,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 13:14:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:08,483 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 13:14:08,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-10 13:14:08,530 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12. Second operand 8 states. Result 77 states and 85 transitions. Complement of second has 15 states. [2018-11-10 13:14:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 13:14:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 13:14:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-11-10 13:14:08,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-10 13:14:08,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:08,531 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 13:14:08,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:08,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:08,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:08,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:14:08,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 13:14:08,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2018-11-10 13:14:08,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:14:08,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:08,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:14:08,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 13:14:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:08,611 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 13:14:08,611 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-10 13:14:08,659 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 70 transitions. cyclomatic complexity: 12. Second operand 8 states. Result 99 states and 111 transitions. Complement of second has 12 states. [2018-11-10 13:14:08,660 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-11-10 13:14:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 13:14:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-11-10 13:14:08,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-10 13:14:08,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:08,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 39 letters. Loop has 9 letters. [2018-11-10 13:14:08,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:08,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 30 letters. Loop has 18 letters. [2018-11-10 13:14:08,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:14:08,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 111 transitions. [2018-11-10 13:14:08,664 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:14:08,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. [2018-11-10 13:14:08,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:14:08,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:14:08,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:14:08,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:14:08,664 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:14:08,664 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:14:08,664 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:14:08,664 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 13:14:08,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:14:08,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:14:08,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:14:08,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:14:08 BoogieIcfgContainer [2018-11-10 13:14:08,670 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:14:08,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:14:08,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:14:08,670 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:14:08,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:14:04" (3/4) ... [2018-11-10 13:14:08,673 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:14:08,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:14:08,673 INFO L168 Benchmark]: Toolchain (without parser) took 5073.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 952.1 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 151.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:08,674 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:14:08,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.77 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 929.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:08,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -210.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:08,675 INFO L168 Benchmark]: Boogie Preprocessor took 16.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:14:08,675 INFO L168 Benchmark]: RCFGBuilder took 232.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:08,675 INFO L168 Benchmark]: BuchiAutomizer took 4488.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.7 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:08,676 INFO L168 Benchmark]: Witness Printer took 3.06 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:14:08,678 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.77 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 929.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -210.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 232.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4488.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.7 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.06 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 51 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 74 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 206 SDtfs, 160 SDslu, 202 SDs, 0 SdLazy, 310 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital180 mio100 ax100 hnf99 lsp96 ukn80 mio100 lsp47 div100 bol100 ite100 ukn100 eq181 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 5 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...