./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array03-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 7541988e6da98f0cff4ac2bb6ea7091660417951 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:41:50,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:41:50,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:41:50,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:41:50,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:41:50,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:41:50,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:41:50,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:41:50,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:41:50,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:41:50,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:41:50,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:41:50,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:41:50,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:41:50,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:41:50,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:41:50,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:41:50,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:41:50,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:41:50,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:41:50,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:41:50,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:41:50,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:41:50,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:41:50,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:41:50,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:41:50,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:41:50,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:41:50,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:41:50,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:41:50,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:41:50,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:41:50,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:41:50,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:41:50,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:41:50,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:41:50,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:41:50,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:41:50,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:41:50,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:41:50,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:41:50,223 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:41:50,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:41:50,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:41:50,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:41:50,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:41:50,272 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:41:50,272 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:41:50,272 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:41:50,273 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:41:50,273 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:41:50,273 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:41:50,273 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:41:50,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:41:50,274 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:41:50,274 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:41:50,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:41:50,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:41:50,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:41:50,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:41:50,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:41:50,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:41:50,276 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:41:50,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:41:50,277 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:41:50,277 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:41:50,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:41:50,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:41:50,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:41:50,278 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:41:50,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:41:50,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:41:50,279 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:41:50,280 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:41:50,281 INFO L138 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/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 -> 7541988e6da98f0cff4ac2bb6ea7091660417951 [2019-11-16 00:41:50,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:41:50,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:41:50,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:41:50,329 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:41:50,329 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:41:50,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/array03-alloca-2.i [2019-11-16 00:41:50,402 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/data/99cb45a6c/7b001e944e9c46ccb0054640dddabe39/FLAGa12ee31d1 [2019-11-16 00:41:51,033 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:41:51,034 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/sv-benchmarks/c/array-memsafety/array03-alloca-2.i [2019-11-16 00:41:51,055 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/data/99cb45a6c/7b001e944e9c46ccb0054640dddabe39/FLAGa12ee31d1 [2019-11-16 00:41:51,359 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/data/99cb45a6c/7b001e944e9c46ccb0054640dddabe39 [2019-11-16 00:41:51,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:41:51,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:41:51,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:41:51,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:41:51,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:41:51,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:41:51" (1/1) ... [2019-11-16 00:41:51,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6a5daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:51, skipping insertion in model container [2019-11-16 00:41:51,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:41:51" (1/1) ... [2019-11-16 00:41:51,390 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:41:51,444 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:41:52,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:41:52,028 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:41:52,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:41:52,171 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:41:52,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52 WrapperNode [2019-11-16 00:41:52,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:41:52,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:41:52,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:41:52,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:41:52,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... [2019-11-16 00:41:52,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... [2019-11-16 00:41:52,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:41:52,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:41:52,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:41:52,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:41:52,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... [2019-11-16 00:41:52,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... [2019-11-16 00:41:52,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... [2019-11-16 00:41:52,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... [2019-11-16 00:41:52,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... [2019-11-16 00:41:52,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... [2019-11-16 00:41:52,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... [2019-11-16 00:41:52,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:41:52,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:41:52,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:41:52,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:41:52,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:41:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:41:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:41:52,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:41:52,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:41:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:41:52,715 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:41:52,716 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:41:52,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:41:52 BoogieIcfgContainer [2019-11-16 00:41:52,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:41:52,718 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:41:52,718 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:41:52,722 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:41:52,723 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:41:52,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:41:51" (1/3) ... [2019-11-16 00:41:52,725 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41fe824b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:41:52, skipping insertion in model container [2019-11-16 00:41:52,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:41:52,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:52" (2/3) ... [2019-11-16 00:41:52,726 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41fe824b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:41:52, skipping insertion in model container [2019-11-16 00:41:52,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:41:52,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:41:52" (3/3) ... [2019-11-16 00:41:52,728 INFO L371 chiAutomizerObserver]: Analyzing ICFG array03-alloca-2.i [2019-11-16 00:41:52,787 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:41:52,787 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:41:52,787 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:41:52,787 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:41:52,787 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:41:52,788 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:41:52,788 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:41:52,788 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:41:52,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:41:52,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:41:52,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:52,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:52,840 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:41:52,840 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:41:52,840 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:41:52,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:41:52,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:41:52,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:52,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:52,844 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:41:52,844 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:41:52,853 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 11#L532true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 16#L532-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 6#L537-3true [2019-11-16 00:41:52,853 INFO L793 eck$LassoCheckResult]: Loop: 6#L537-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 4#L537-2true main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 6#L537-3true [2019-11-16 00:41:52,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-16 00:41:52,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:52,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780760881] [2019-11-16 00:41:52,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:52,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:52,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:53,012 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:53,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-16 00:41:53,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:53,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264727050] [2019-11-16 00:41:53,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:53,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:53,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:53,066 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-16 00:41:53,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:53,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750696473] [2019-11-16 00:41:53,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:53,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:53,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:53,150 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:53,432 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:41:53,433 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:41:53,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:41:53,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:41:53,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:41:53,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:41:53,434 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:41:53,434 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:41:53,434 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration1_Lasso [2019-11-16 00:41:53,434 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:41:53,438 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:41:53,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:53,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:53,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:53,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:53,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:53,672 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-16 00:41:53,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:53,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:53,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:53,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:54,058 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:41:54,065 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:41:54,067 INFO L120 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 [2019-11-16 00:41:54,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:54,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:54,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:54,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:54,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:54,072 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:54,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:54,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:54,082 INFO L120 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 [2019-11-16 00:41:54,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:54,084 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:54,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:54,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:54,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:54,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:54,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:54,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:54,091 INFO L120 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 [2019-11-16 00:41:54,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:54,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:54,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:54,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:54,101 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:54,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:54,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:54,112 INFO L120 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 [2019-11-16 00:41:54,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:54,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:54,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:54,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:54,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:54,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:54,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:54,125 INFO L120 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 [2019-11-16 00:41:54,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:54,133 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:54,134 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:54,134 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:54,134 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:54,135 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:54,135 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:54,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:54,138 INFO L120 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 [2019-11-16 00:41:54,140 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:54,140 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:54,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:54,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:54,146 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:54,148 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:54,321 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:41:54,357 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:41:54,358 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:41:54,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:41:54,362 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:41:54,362 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:41:54,363 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~numbers~0.offset, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~k~0 - 1*ULTIMATE.start_main_~numbers~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [] [2019-11-16 00:41:54,385 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:41:54,399 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:41:54,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:54,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:41:54,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:54,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:41:54,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:54,501 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 [2019-11-16 00:41:54,502 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-16 00:41:54,593 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 44 states and 65 transitions. Complement of second has 7 states. [2019-11-16 00:41:54,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:41:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:41:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-11-16 00:41:54,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:41:54,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:41:54,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:41:54,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:41:54,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:41:54,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:41:54,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2019-11-16 00:41:54,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:41:54,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 15 states and 21 transitions. [2019-11-16 00:41:54,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:41:54,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:41:54,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-11-16 00:41:54,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:41:54,613 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-16 00:41:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-11-16 00:41:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-16 00:41:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:41:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-11-16 00:41:54,645 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-16 00:41:54,645 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-16 00:41:54,646 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:41:54,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-11-16 00:41:54,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:41:54,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:54,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:54,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:41:54,648 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:41:54,648 INFO L791 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 130#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 131#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 124#L537-3 assume !(main_~k~0 < main_~array_size~0); 125#L537-4 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; 120#L516-3 [2019-11-16 00:41:54,648 INFO L793 eck$LassoCheckResult]: Loop: 120#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 123#L518 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 128#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 126#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 127#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 119#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 120#L516-3 [2019-11-16 00:41:54,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:54,649 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-16 00:41:54,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:54,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069855707] [2019-11-16 00:41:54,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:54,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069855707] [2019-11-16 00:41:54,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:54,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:41:54,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428030296] [2019-11-16 00:41:54,713 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:41:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1807826313, now seen corresponding path program 1 times [2019-11-16 00:41:54,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:54,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639803529] [2019-11-16 00:41:54,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:54,755 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:54,859 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-16 00:41:54,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:54,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:41:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:41:54,890 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-16 00:41:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:54,920 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2019-11-16 00:41:54,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:41:54,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-11-16 00:41:54,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:41:54,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2019-11-16 00:41:54,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:41:54,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:41:54,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-16 00:41:54,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:41:54,923 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-16 00:41:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-16 00:41:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-16 00:41:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:41:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-16 00:41:54,926 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-16 00:41:54,926 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-16 00:41:54,926 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:41:54,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-16 00:41:54,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:41:54,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:54,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:54,928 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:54,928 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:41:54,928 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 167#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 168#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 169#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 162#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 159#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 160#L537-3 assume !(main_~k~0 < main_~array_size~0); 163#L537-4 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; 158#L516-3 [2019-11-16 00:41:54,928 INFO L793 eck$LassoCheckResult]: Loop: 158#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 161#L518 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 166#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 164#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 165#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 157#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 158#L516-3 [2019-11-16 00:41:54,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-16 00:41:54,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:54,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204750664] [2019-11-16 00:41:54,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:54,951 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1807826313, now seen corresponding path program 2 times [2019-11-16 00:41:54,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:54,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363985229] [2019-11-16 00:41:54,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:54,963 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash -260572169, now seen corresponding path program 1 times [2019-11-16 00:41:54,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:54,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517179301] [2019-11-16 00:41:54,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:55,013 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:55,317 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-16 00:41:55,384 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:41:55,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:41:55,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:41:55,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:41:55,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:41:55,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:41:55,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:41:55,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:41:55,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration3_Lasso [2019-11-16 00:41:55,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:41:55,386 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:41:55,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,562 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-16 00:41:55,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:55,821 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-16 00:41:56,044 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:41:56,044 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:41:56,044 INFO L120 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 [2019-11-16 00:41:56,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,045 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:56,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,046 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:56,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:56,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,047 INFO L120 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 [2019-11-16 00:41:56,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:56,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:56,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:56,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,049 INFO L120 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 [2019-11-16 00:41:56,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:56,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:56,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:56,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,052 INFO L120 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 [2019-11-16 00:41:56,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:56,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,053 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:56,053 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:56,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,054 INFO L120 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 [2019-11-16 00:41:56,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,054 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:56,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,055 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:56,055 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:56,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,056 INFO L120 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 [2019-11-16 00:41:56,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,058 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:56,058 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:56,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,060 INFO L120 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 [2019-11-16 00:41:56,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:56,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,062 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:56,062 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:56,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,063 INFO L120 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 [2019-11-16 00:41:56,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,065 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:56,065 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:56,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,068 INFO L120 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 [2019-11-16 00:41:56,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,069 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:41:56,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,072 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:41:56,072 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:56,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,082 INFO L120 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 [2019-11-16 00:41:56,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,084 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:56,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:56,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,086 INFO L120 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 [2019-11-16 00:41:56,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,088 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:56,089 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:56,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,095 INFO L120 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 [2019-11-16 00:41:56,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,095 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:56,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:56,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:56,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:56,104 INFO L120 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 [2019-11-16 00:41:56,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:56,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:56,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:56,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:56,109 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:56,111 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:56,167 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:41:56,193 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:41:56,193 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:41:56,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:41:56,195 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:41:56,195 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:41:56,196 INFO L512 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 [] [2019-11-16 00:41:56,208 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:41:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:56,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:41:56,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:56,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:41:56,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:56,261 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 [2019-11-16 00:41:56,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-16 00:41:56,290 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 31 transitions. Complement of second has 4 states. [2019-11-16 00:41:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:41:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:41:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-16 00:41:56,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-16 00:41:56,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:41:56,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-16 00:41:56,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:41:56,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 12 letters. [2019-11-16 00:41:56,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:41:56,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2019-11-16 00:41:56,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:56,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 29 transitions. [2019-11-16 00:41:56,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:41:56,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:41:56,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-11-16 00:41:56,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:41:56,295 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-16 00:41:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-11-16 00:41:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-16 00:41:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:41:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-16 00:41:56,298 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-16 00:41:56,298 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-16 00:41:56,298 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:41:56,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-16 00:41:56,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:56,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:56,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:56,300 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:56,300 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:41:56,302 INFO L791 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 286#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 287#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 288#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 279#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 274#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 275#L537-3 assume !(main_~k~0 < main_~array_size~0); 280#L537-4 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; 276#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 278#L518 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 282#L523-2 [2019-11-16 00:41:56,302 INFO L793 eck$LassoCheckResult]: Loop: 282#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 281#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 282#L523-2 [2019-11-16 00:41:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811566, now seen corresponding path program 1 times [2019-11-16 00:41:56,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:56,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479476418] [2019-11-16 00:41:56,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:56,354 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2019-11-16 00:41:56,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:56,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888828512] [2019-11-16 00:41:56,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:56,364 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:56,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99347910] [2019-11-16 00:41:56,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:56,445 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:56,446 INFO L82 PathProgramCache]: Analyzing trace with hash -357812649, now seen corresponding path program 1 times [2019-11-16 00:41:56,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:56,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988673932] [2019-11-16 00:41:56,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:56,451 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:56,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67854354] [2019-11-16 00:41:56,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:56,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:41:56,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:56,673 INFO L375 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 7 [2019-11-16 00:41:56,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:56,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:56,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:56,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-11-16 00:41:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:41:56,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988673932] [2019-11-16 00:41:56,686 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:41:56,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67854354] [2019-11-16 00:41:56,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:56,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:41:56,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985029876] [2019-11-16 00:41:56,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:56,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:41:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:41:56,729 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-16 00:41:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:56,776 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-11-16 00:41:56,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:41:56,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2019-11-16 00:41:56,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:56,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 31 transitions. [2019-11-16 00:41:56,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:41:56,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:41:56,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-11-16 00:41:56,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:41:56,779 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-16 00:41:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-11-16 00:41:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-16 00:41:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:41:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-16 00:41:56,781 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-16 00:41:56,782 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-16 00:41:56,782 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:41:56,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-11-16 00:41:56,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:56,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:56,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:56,783 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:56,783 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:41:56,783 INFO L791 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 376#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 377#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 369#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 364#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 365#L537-3 assume !(main_~k~0 < main_~array_size~0); 370#L537-4 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; 366#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 368#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 380#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 372#L523-2 [2019-11-16 00:41:56,784 INFO L793 eck$LassoCheckResult]: Loop: 372#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 371#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 372#L523-2 [2019-11-16 00:41:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2019-11-16 00:41:56,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:56,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920740743] [2019-11-16 00:41:56,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:56,802 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 2 times [2019-11-16 00:41:56,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:56,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438692668] [2019-11-16 00:41:56,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:56,806 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:56,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974893182] [2019-11-16 00:41:56,806 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:56,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:41:56,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:41:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:56,858 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:56,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1792764442, now seen corresponding path program 1 times [2019-11-16 00:41:56,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:56,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189941330] [2019-11-16 00:41:56,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:56,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:56,864 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:56,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1252198603] [2019-11-16 00:41:56,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:56,949 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:57,312 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-11-16 00:41:57,395 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:41:57,396 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:41:57,396 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:41:57,396 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:41:57,396 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:41:57,396 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:41:57,396 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:41:57,396 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:41:57,396 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration5_Lasso [2019-11-16 00:41:57,397 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:41:57,397 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:41:57,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,612 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-11-16 00:41:57,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:41:57,892 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-16 00:41:58,258 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:41:58,258 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:41:58,258 INFO L120 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 [2019-11-16 00:41:58,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,259 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,260 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,260 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,261 INFO L120 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 [2019-11-16 00:41:58,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,263 INFO L120 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 [2019-11-16 00:41:58,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,263 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,263 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,265 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:58,265 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:58,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,266 INFO L120 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 [2019-11-16 00:41:58,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,267 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,267 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,268 INFO L120 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 [2019-11-16 00:41:58,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,270 INFO L120 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 [2019-11-16 00:41:58,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,272 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:58,272 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:58,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,274 INFO L120 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 [2019-11-16 00:41:58,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,276 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,276 INFO L120 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 [2019-11-16 00:41:58,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,278 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,279 INFO L120 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 [2019-11-16 00:41:58,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,280 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:58,281 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:58,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,282 INFO L120 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 [2019-11-16 00:41:58,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,318 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,318 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,319 INFO L120 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 [2019-11-16 00:41:58,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,320 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,320 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,320 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,321 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,322 INFO L120 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 [2019-11-16 00:41:58,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,323 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,324 INFO L120 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 [2019-11-16 00:41:58,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,324 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,325 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,325 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,326 INFO L120 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 [2019-11-16 00:41:58,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,328 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:58,328 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:58,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,330 INFO L120 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 [2019-11-16 00:41:58,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:41:58,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,331 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:41:58,331 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:41:58,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,332 INFO L120 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 [2019-11-16 00:41:58,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,332 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,332 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,334 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:58,334 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:58,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,338 INFO L120 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 [2019-11-16 00:41:58,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,342 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:58,342 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:58,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:41:58,354 INFO L120 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 [2019-11-16 00:41:58,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:41:58,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:41:58,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:41:58,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:41:58,357 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:41:58,357 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:41:58,370 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:41:58,373 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:41:58,373 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:41:58,374 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:41:58,374 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:41:58,375 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:41:58,375 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2019-11-16 00:41:58,387 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-16 00:41:58,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:41:58,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:58,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:41:58,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:58,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:41:58,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:58,434 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 [2019-11-16 00:41:58,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-16 00:41:58,454 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 44 states and 59 transitions. Complement of second has 7 states. [2019-11-16 00:41:58,454 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 [2019-11-16 00:41:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:41:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-16 00:41:58,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:41:58,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:41:58,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-16 00:41:58,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:41:58,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-16 00:41:58,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:41:58,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. [2019-11-16 00:41:58,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:41:58,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 39 states and 52 transitions. [2019-11-16 00:41:58,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-16 00:41:58,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-16 00:41:58,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 52 transitions. [2019-11-16 00:41:58,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:41:58,459 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2019-11-16 00:41:58,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 52 transitions. [2019-11-16 00:41:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2019-11-16 00:41:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-16 00:41:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2019-11-16 00:41:58,463 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2019-11-16 00:41:58,463 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2019-11-16 00:41:58,463 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:41:58,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. [2019-11-16 00:41:58,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:58,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:58,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:58,464 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:58,465 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:41:58,465 INFO L791 eck$LassoCheckResult]: Stem: 534#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 529#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 530#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 531#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 523#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 517#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 518#L537-3 assume !(main_~k~0 < main_~array_size~0); 524#L537-4 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; 519#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 520#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 537#L520 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 526#L523-2 [2019-11-16 00:41:58,465 INFO L793 eck$LassoCheckResult]: Loop: 526#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 525#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 526#L523-2 [2019-11-16 00:41:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383699, now seen corresponding path program 1 times [2019-11-16 00:41:58,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:58,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895548905] [2019-11-16 00:41:58,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:58,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:58,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:58,485 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 3 times [2019-11-16 00:41:58,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:58,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064480928] [2019-11-16 00:41:58,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:58,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:58,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:58,488 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:58,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243180671] [2019-11-16 00:41:58,489 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:58,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-16 00:41:58,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:41:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:58,572 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762520, now seen corresponding path program 1 times [2019-11-16 00:41:58,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:58,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987344610] [2019-11-16 00:41:58,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:58,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:58,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:58,581 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:58,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1029769157] [2019-11-16 00:41:58,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:58,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:41:58,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:58,671 INFO L375 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 25 treesize of output 9 [2019-11-16 00:41:58,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:58,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:58,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:58,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-11-16 00:41:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:41:58,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987344610] [2019-11-16 00:41:58,682 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:41:58,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029769157] [2019-11-16 00:41:58,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:58,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:41:58,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627130092] [2019-11-16 00:41:58,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:41:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:41:58,722 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-16 00:41:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:58,793 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-11-16 00:41:58,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:41:58,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2019-11-16 00:41:58,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:58,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 37 states and 46 transitions. [2019-11-16 00:41:58,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:41:58,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:41:58,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2019-11-16 00:41:58,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:41:58,797 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-11-16 00:41:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2019-11-16 00:41:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-11-16 00:41:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:41:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-11-16 00:41:58,800 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-16 00:41:58,800 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-16 00:41:58,800 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:41:58,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2019-11-16 00:41:58,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:58,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:58,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:58,802 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:58,802 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:41:58,802 INFO L791 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 653#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 654#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 646#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 641#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 642#L537-3 assume !(main_~k~0 < main_~array_size~0); 647#L537-4 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; 643#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 644#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 668#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 651#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 656#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 661#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 639#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 640#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 662#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 658#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 649#L523-2 [2019-11-16 00:41:58,802 INFO L793 eck$LassoCheckResult]: Loop: 649#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 648#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 649#L523-2 [2019-11-16 00:41:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash 869045162, now seen corresponding path program 1 times [2019-11-16 00:41:58,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:58,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699252519] [2019-11-16 00:41:58,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:58,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:58,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:58,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699252519] [2019-11-16 00:41:58,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394499114] [2019-11-16 00:41:58,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:58,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:58,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:59,055 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:41:59,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-16 00:41:59,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212688758] [2019-11-16 00:41:59,056 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:41:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:59,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 4 times [2019-11-16 00:41:59,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:59,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68748341] [2019-11-16 00:41:59,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:59,059 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:59,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564760116] [2019-11-16 00:41:59,060 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:59,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:41:59,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:41:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:59,128 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:59,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:41:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:41:59,161 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 14 Second operand 13 states. [2019-11-16 00:41:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:59,337 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2019-11-16 00:41:59,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:41:59,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2019-11-16 00:41:59,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:59,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 34 states and 42 transitions. [2019-11-16 00:41:59,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:41:59,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:41:59,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-11-16 00:41:59,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:41:59,339 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-16 00:41:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-11-16 00:41:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-16 00:41:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:41:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-16 00:41:59,342 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-16 00:41:59,342 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-16 00:41:59,342 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:41:59,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-16 00:41:59,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:59,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:59,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:59,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:59,343 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:41:59,344 INFO L791 eck$LassoCheckResult]: Stem: 816#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 811#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 812#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 813#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 804#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 800#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 801#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 805#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 824#L537-3 assume !(main_~k~0 < main_~array_size~0); 810#L537-4 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; 802#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 803#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 829#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 809#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 815#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 820#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 821#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 825#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 822#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 817#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 807#L523-2 [2019-11-16 00:41:59,344 INFO L793 eck$LassoCheckResult]: Loop: 807#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 806#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 807#L523-2 [2019-11-16 00:41:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -185139956, now seen corresponding path program 2 times [2019-11-16 00:41:59,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:59,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363080956] [2019-11-16 00:41:59,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:41:59,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363080956] [2019-11-16 00:41:59,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:59,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:41:59,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957497870] [2019-11-16 00:41:59,387 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:41:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 5 times [2019-11-16 00:41:59,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:59,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184268578] [2019-11-16 00:41:59,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:59,390 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:59,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058199428] [2019-11-16 00:41:59,390 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/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 [2019-11-16 00:41:59,469 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:41:59,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:41:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:59,476 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:59,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:59,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:59,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:59,516 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-11-16 00:41:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:59,586 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-11-16 00:41:59,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:59,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2019-11-16 00:41:59,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:59,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 47 transitions. [2019-11-16 00:41:59,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:41:59,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:41:59,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-11-16 00:41:59,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:41:59,589 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-16 00:41:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-11-16 00:41:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-16 00:41:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-16 00:41:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-11-16 00:41:59,593 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-11-16 00:41:59,593 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-11-16 00:41:59,593 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:41:59,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2019-11-16 00:41:59,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:41:59,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:41:59,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:41:59,595 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:59,595 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:41:59,595 INFO L791 eck$LassoCheckResult]: Stem: 900#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 895#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 896#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 897#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 888#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 884#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 885#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 889#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 909#L537-3 assume !(main_~k~0 < main_~array_size~0); 894#L537-4 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; 886#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 887#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 914#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 898#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 899#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 917#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 915#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 905#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 906#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 910#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 907#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 901#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 891#L523-2 [2019-11-16 00:41:59,596 INFO L793 eck$LassoCheckResult]: Loop: 891#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 890#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 891#L523-2 [2019-11-16 00:41:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:59,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2055932007, now seen corresponding path program 1 times [2019-11-16 00:41:59,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:59,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908796406] [2019-11-16 00:41:59,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:59,604 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:59,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128737366] [2019-11-16 00:41:59,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:59,724 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 6 times [2019-11-16 00:41:59,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:59,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061810969] [2019-11-16 00:41:59,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:59,730 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:59,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640972436] [2019-11-16 00:41:59,730 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:59,786 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2019-11-16 00:41:59,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:41:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:59,797 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:41:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash 65704044, now seen corresponding path program 2 times [2019-11-16 00:41:59,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:59,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768950450] [2019-11-16 00:41:59,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:59,812 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:41:59,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [252607684] [2019-11-16 00:41:59,812 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_551ab0b7-721f-478d-ac80-8c43f3acfd8c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:59,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:41:59,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-16 00:41:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:41:59,924 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:42:00,508 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 138 [2019-11-16 00:42:00,627 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-16 00:42:00,629 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:42:00,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:42:00,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:42:00,630 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:42:00,630 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:42:00,630 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:42:00,630 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:42:00,630 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:42:00,630 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration9_Lasso [2019-11-16 00:42:00,630 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:42:00,630 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:42:00,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:42:00,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:42:00,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:42:00,665 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:42:00,668 INFO L168 Benchmark]: Toolchain (without parser) took 9304.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 946.1 MB in the beginning and 891.5 MB in the end (delta: 54.6 MB). Peak memory consumption was 349.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:00,669 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:00,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -205.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:00,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:00,670 INFO L168 Benchmark]: Boogie Preprocessor took 29.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:00,671 INFO L168 Benchmark]: RCFGBuilder took 444.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:00,671 INFO L168 Benchmark]: BuchiAutomizer took 7949.08 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 891.5 MB in the end (delta: 233.0 MB). Peak memory consumption was 354.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:00,674 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 806.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -205.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 444.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7949.08 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 891.5 MB in the end (delta: 233.0 MB). Peak memory consumption was 354.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...