./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/array03-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.25-9a8b2e8 [2020-10-20 08:17:42,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:17:42,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:17:42,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:17:42,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:17:42,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:17:42,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:17:42,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:17:42,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:17:42,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:17:42,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:17:42,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:17:42,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:17:42,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:17:42,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:17:42,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:17:42,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:17:42,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:17:42,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:17:42,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:17:42,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:17:42,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:17:42,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:17:42,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:17:42,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:17:42,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:17:42,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:17:42,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:17:42,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:17:42,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:17:42,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:17:42,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:17:42,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:17:42,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:17:42,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:17:42,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:17:42,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:17:42,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:17:42,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:17:42,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:17:42,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:17:42,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:17:42,570 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:17:42,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:17:42,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:17:42,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:17:42,574 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:17:42,574 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:17:42,574 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:17:42,574 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:17:42,575 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:17:42,575 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:17:42,576 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:17:42,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:17:42,577 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:17:42,577 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:17:42,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:17:42,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:17:42,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:17:42,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:17:42,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:17:42,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:17:42,579 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:17:42,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:17:42,580 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:17:42,580 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:17:42,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:17:42,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:17:42,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:17:42,581 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:17:42,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:17:42,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:17:42,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:17:42,582 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:17:42,583 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:17:42,583 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2020-10-20 08:17:42,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:17:42,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:17:42,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:17:42,813 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:17:42,814 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:17:42,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array03-alloca-2.i [2020-10-20 08:17:42,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d148bc9d/8271854d12a14531971c36bd3b372b1a/FLAG6bf4949b6 [2020-10-20 08:17:43,457 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:17:43,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array03-alloca-2.i [2020-10-20 08:17:43,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d148bc9d/8271854d12a14531971c36bd3b372b1a/FLAG6bf4949b6 [2020-10-20 08:17:43,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d148bc9d/8271854d12a14531971c36bd3b372b1a [2020-10-20 08:17:43,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:17:43,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:17:43,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:17:43,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:17:43,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:17:43,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:17:43" (1/1) ... [2020-10-20 08:17:43,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a63432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:43, skipping insertion in model container [2020-10-20 08:17:43,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:17:43" (1/1) ... [2020-10-20 08:17:43,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:17:43,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:17:44,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:17:44,268 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:17:44,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:17:44,368 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:17:44,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44 WrapperNode [2020-10-20 08:17:44,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:17:44,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:17:44,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:17:44,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:17:44,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... [2020-10-20 08:17:44,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... [2020-10-20 08:17:44,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:17:44,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:17:44,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:17:44,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:17:44,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... [2020-10-20 08:17:44,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... [2020-10-20 08:17:44,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... [2020-10-20 08:17:44,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... [2020-10-20 08:17:44,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... [2020-10-20 08:17:44,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... [2020-10-20 08:17:44,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... [2020-10-20 08:17:44,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:17:44,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:17:44,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:17:44,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:17:44,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 08:17:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:17:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:17:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:17:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:17:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:17:44,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:17:44,877 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:17:44,878 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-20 08:17:44,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:17:44 BoogieIcfgContainer [2020-10-20 08:17:44,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:17:44,881 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:17:44,881 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:17:44,885 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:17:44,887 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:17:44,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:17:43" (1/3) ... [2020-10-20 08:17:44,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61f78634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:17:44, skipping insertion in model container [2020-10-20 08:17:44,889 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:17:44,889 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:44" (2/3) ... [2020-10-20 08:17:44,889 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61f78634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:17:44, skipping insertion in model container [2020-10-20 08:17:44,890 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:17:44,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:17:44" (3/3) ... [2020-10-20 08:17:44,892 INFO L373 chiAutomizerObserver]: Analyzing ICFG array03-alloca-2.i [2020-10-20 08:17:44,936 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:17:44,936 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:17:44,936 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:17:44,937 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:17:44,937 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:17:44,937 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:17:44,938 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:17:44,938 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:17:44,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 08:17:44,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-20 08:17:44,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:44,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:44,988 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 08:17:44,988 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:44,988 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:17:44,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 08:17:44,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-20 08:17:44,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:44,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:44,991 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 08:17:44,991 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:44,998 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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 [2020-10-20 08:17:44,998 INFO L796 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 [2020-10-20 08:17:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-20 08:17:45,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:45,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314538092] [2020-10-20 08:17:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:45,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:45,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:45,155 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:45,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-10-20 08:17:45,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:45,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536158274] [2020-10-20 08:17:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:45,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:45,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:45,178 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-10-20 08:17:45,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:45,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741678040] [2020-10-20 08:17:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:45,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:45,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:45,232 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:45,420 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-10-20 08:17:45,502 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:45,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:45,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:45,503 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:45,503 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:45,504 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:45,504 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:45,504 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:45,504 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration1_Lasso [2020-10-20 08:17:45,504 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:45,505 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:45,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:45,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:45,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:45,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:45,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:45,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:45,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:45,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:45,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:45,977 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:45,983 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:45,990 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 [2020-10-20 08:17:45,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:45,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:45,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:45,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:45,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:45,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:45,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:46,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:46,033 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 [2020-10-20 08:17:46,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:46,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:46,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:46,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:46,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:46,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:46,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:46,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:46,085 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 [2020-10-20 08:17:46,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:46,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:46,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:46,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:46,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:46,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:46,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:46,207 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-20 08:17:46,207 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:46,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:17:46,220 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 08:17:46,220 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:46,221 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2020-10-20 08:17:46,272 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 08:17:46,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:17:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:46,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:46,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:46,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:17:46,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:46,385 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 [2020-10-20 08:17:46,386 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-10-20 08:17:46,489 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 44 states and 65 transitions. Complement of second has 7 states. [2020-10-20 08:17:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-10-20 08:17:46,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 08:17:46,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:46,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 2 letters. [2020-10-20 08:17:46,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:46,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-20 08:17:46,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:46,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2020-10-20 08:17:46,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:17:46,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 15 states and 21 transitions. [2020-10-20 08:17:46,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 08:17:46,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 08:17:46,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2020-10-20 08:17:46,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:46,512 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-20 08:17:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2020-10-20 08:17:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-20 08:17:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 08:17:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-10-20 08:17:46,545 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-20 08:17:46,546 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-20 08:17:46,546 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:17:46,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-10-20 08:17:46,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:17:46,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:46,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:46,573 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:17:46,573 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:17:46,574 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 138#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; 139#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 140#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; 133#L537-3 assume !(main_~k~0 < main_~array_size~0); 134#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; 129#L516-3 [2020-10-20 08:17:46,577 INFO L796 eck$LassoCheckResult]: Loop: 129#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); 132#L518 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 137#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 135#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 136#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 128#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 129#L516-3 [2020-10-20 08:17:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-10-20 08:17:46,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:46,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177712522] [2020-10-20 08:17:46,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:46,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177712522] [2020-10-20 08:17:46,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:46,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:17:46,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025825758] [2020-10-20 08:17:46,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:46,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:46,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1807826313, now seen corresponding path program 1 times [2020-10-20 08:17:46,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:46,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579112373] [2020-10-20 08:17:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:46,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:46,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:46,698 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:46,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:46,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:17:46,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:17:46,796 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-20 08:17:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:46,826 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-10-20 08:17:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:17:46,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2020-10-20 08:17:46,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:17:46,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2020-10-20 08:17:46,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 08:17:46,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 08:17:46,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-10-20 08:17:46,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:46,831 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-20 08:17:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-10-20 08:17:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-20 08:17:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 08:17:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-20 08:17:46,833 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 08:17:46,833 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 08:17:46,834 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:17:46,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-20 08:17:46,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:17:46,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:46,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:46,836 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:46,836 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:17:46,836 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 176#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; 177#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 178#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; 171#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; 168#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 169#L537-3 assume !(main_~k~0 < main_~array_size~0); 172#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; 167#L516-3 [2020-10-20 08:17:46,836 INFO L796 eck$LassoCheckResult]: Loop: 167#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); 170#L518 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 175#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 173#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 174#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 166#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 167#L516-3 [2020-10-20 08:17:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:46,837 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-10-20 08:17:46,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:46,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148344923] [2020-10-20 08:17:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:46,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:46,869 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:46,874 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1807826313, now seen corresponding path program 2 times [2020-10-20 08:17:46,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:46,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476532356] [2020-10-20 08:17:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:46,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:46,891 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:46,894 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash -260572169, now seen corresponding path program 1 times [2020-10-20 08:17:46,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:46,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56877064] [2020-10-20 08:17:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:46,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:46,958 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:46,964 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:47,271 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2020-10-20 08:17:47,366 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:47,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:47,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:47,367 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:47,367 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:47,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:47,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:47,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:47,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration3_Lasso [2020-10-20 08:17:47,367 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:47,367 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:47,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,562 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2020-10-20 08:17:47,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:47,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:48,077 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:48,078 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:48,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 [2020-10-20 08:17:48,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:48,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:48,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:48,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:48,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:48,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:48,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:48,170 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 [2020-10-20 08:17:48,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:48,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:48,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:48,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:48,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:48,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:48,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:48,225 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 [2020-10-20 08:17:48,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:48,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:48,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:48,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:48,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:48,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:48,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:48,301 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-20 08:17:48,301 INFO L444 ModelExtractionUtils]: 24 out of 37 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:48,307 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:17:48,311 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:48,312 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:48,312 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 [] [2020-10-20 08:17:48,350 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2020-10-20 08:17:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:48,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:48,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:48,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:48,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:48,413 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 [2020-10-20 08:17:48,414 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-20 08:17:48,443 INFO L75 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. [2020-10-20 08:17:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2020-10-20 08:17:48,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2020-10-20 08:17:48,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:48,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2020-10-20 08:17:48,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:48,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 12 letters. [2020-10-20 08:17:48,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:48,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2020-10-20 08:17:48,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:48,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 29 transitions. [2020-10-20 08:17:48,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 08:17:48,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 08:17:48,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2020-10-20 08:17:48,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:48,450 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:17:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2020-10-20 08:17:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-20 08:17:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:17:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-10-20 08:17:48,452 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:17:48,452 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:17:48,453 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:17:48,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-10-20 08:17:48,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:48,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:48,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:48,457 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:48,457 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:48,457 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 299#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; 300#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 301#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; 292#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; 287#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 288#L537-3 assume !(main_~k~0 < main_~array_size~0); 293#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; 289#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); 291#L518 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 295#L523-2 [2020-10-20 08:17:48,457 INFO L796 eck$LassoCheckResult]: Loop: 295#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 294#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~mem7;havoc test_fun_#t~post8; 295#L523-2 [2020-10-20 08:17:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811566, now seen corresponding path program 1 times [2020-10-20 08:17:48,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:48,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692226288] [2020-10-20 08:17:48,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:48,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:48,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:48,489 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:48,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2020-10-20 08:17:48,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:48,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426971593] [2020-10-20 08:17:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:48,495 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:48,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [443997018] [2020-10-20 08:17:48,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 08:17:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:48,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:48,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:48,553 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash -357812649, now seen corresponding path program 1 times [2020-10-20 08:17:48,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:48,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437172931] [2020-10-20 08:17:48,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:48,564 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:48,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597456111] [2020-10-20 08:17:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 08:17:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:48,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:48,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:48,724 INFO L384 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 [2020-10-20 08:17:48,726 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:48,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:48,729 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:48,729 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2020-10-20 08:17:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:17:48,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437172931] [2020-10-20 08:17:48,736 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-20 08:17:48,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597456111] [2020-10-20 08:17:48,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:48,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:17:48,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566133412] [2020-10-20 08:17:48,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:48,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:17:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:17:48,777 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 08:17:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:48,823 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-10-20 08:17:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:17:48,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2020-10-20 08:17:48,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:48,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 31 transitions. [2020-10-20 08:17:48,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 08:17:48,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 08:17:48,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2020-10-20 08:17:48,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:48,826 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-20 08:17:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2020-10-20 08:17:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-20 08:17:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 08:17:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-10-20 08:17:48,829 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-20 08:17:48,829 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-20 08:17:48,829 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:17:48,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2020-10-20 08:17:48,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:48,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:48,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:48,830 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:48,831 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:48,831 INFO L794 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 388#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; 389#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 390#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; 382#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; 377#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 378#L537-3 assume !(main_~k~0 < main_~array_size~0); 383#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; 379#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); 381#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); 394#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 385#L523-2 [2020-10-20 08:17:48,831 INFO L796 eck$LassoCheckResult]: Loop: 385#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 384#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~mem7;havoc test_fun_#t~post8; 385#L523-2 [2020-10-20 08:17:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2020-10-20 08:17:48,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:48,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524579179] [2020-10-20 08:17:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:48,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:48,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:48,863 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:48,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 2 times [2020-10-20 08:17:48,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:48,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458141642] [2020-10-20 08:17:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:48,867 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:48,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158869966] [2020-10-20 08:17:48,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 08:17:48,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-20 08:17:48,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-20 08:17:48,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:48,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:48,931 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:48,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1792764442, now seen corresponding path program 1 times [2020-10-20 08:17:48,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:48,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174955565] [2020-10-20 08:17:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:48,963 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:48,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609221386] [2020-10-20 08:17:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 08:17:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:49,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:49,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:49,062 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:49,401 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2020-10-20 08:17:49,506 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:49,506 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:49,506 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:49,506 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:49,506 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:49,507 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:49,507 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:49,507 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:49,507 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration5_Lasso [2020-10-20 08:17:49,507 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:49,508 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:49,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,720 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2020-10-20 08:17:49,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:49,983 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-10-20 08:17:50,296 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:50,297 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,312 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 [2020-10-20 08:17:50,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:50,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:50,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:50,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,342 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 [2020-10-20 08:17:50,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:50,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:50,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:50,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,370 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 [2020-10-20 08:17:50,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:50,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:50,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,401 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 [2020-10-20 08:17:50,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:50,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:50,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:50,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,433 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 [2020-10-20 08:17:50,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:50,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:50,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:50,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:50,473 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 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:50,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:50,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,504 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 [2020-10-20 08:17:50,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:50,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:50,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:50,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,531 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 [2020-10-20 08:17:50,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:50,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:50,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,591 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 [2020-10-20 08:17:50,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:50,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:50,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,648 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 [2020-10-20 08:17:50,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:50,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:50,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:50,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:50,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:50,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:50,667 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:50,704 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-20 08:17:50,704 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:50,718 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,722 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:50,722 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:50,723 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 [] [2020-10-20 08:17:50,778 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-20 08:17:50,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 08:17:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:50,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:50,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:50,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:17:50,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:50,840 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 [2020-10-20 08:17:50,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-10-20 08:17:50,869 INFO L75 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. [2020-10-20 08:17:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-10-20 08:17:50,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-20 08:17:50,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:50,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 2 letters. [2020-10-20 08:17:50,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:50,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-20 08:17:50,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:50,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. [2020-10-20 08:17:50,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 08:17:50,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 39 states and 52 transitions. [2020-10-20 08:17:50,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 08:17:50,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 08:17:50,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 52 transitions. [2020-10-20 08:17:50,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:50,875 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2020-10-20 08:17:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 52 transitions. [2020-10-20 08:17:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-10-20 08:17:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 08:17:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2020-10-20 08:17:50,884 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2020-10-20 08:17:50,885 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2020-10-20 08:17:50,885 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:17:50,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. [2020-10-20 08:17:50,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:50,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:50,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:50,888 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:50,888 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:50,888 INFO L794 eck$LassoCheckResult]: Stem: 547#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 542#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; 543#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 544#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; 536#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; 530#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 531#L537-3 assume !(main_~k~0 < main_~array_size~0); 537#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; 532#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); 534#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); 548#L520 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 539#L523-2 [2020-10-20 08:17:50,888 INFO L796 eck$LassoCheckResult]: Loop: 539#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 538#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~mem7;havoc test_fun_#t~post8; 539#L523-2 [2020-10-20 08:17:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383699, now seen corresponding path program 1 times [2020-10-20 08:17:50,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:50,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120218122] [2020-10-20 08:17:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:50,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:50,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:50,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:50,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 3 times [2020-10-20 08:17:50,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:50,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589943865] [2020-10-20 08:17:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:50,964 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:50,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [904414450] [2020-10-20 08:17:50,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:50,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-10-20 08:17:50,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-20 08:17:50,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:51,014 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:51,017 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:51,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:51,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762520, now seen corresponding path program 1 times [2020-10-20 08:17:51,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:51,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322478237] [2020-10-20 08:17:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:51,032 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:51,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834206401] [2020-10-20 08:17:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:51,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:51,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:51,109 INFO L384 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 [2020-10-20 08:17:51,110 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:51,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:51,115 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:51,116 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2020-10-20 08:17:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:17:51,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322478237] [2020-10-20 08:17:51,122 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-20 08:17:51,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834206401] [2020-10-20 08:17:51,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:51,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:17:51,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172331384] [2020-10-20 08:17:51,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:17:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:17:51,166 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. cyclomatic complexity: 18 Second operand 5 states. [2020-10-20 08:17:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:51,238 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-10-20 08:17:51,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:17:51,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2020-10-20 08:17:51,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:51,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 37 states and 46 transitions. [2020-10-20 08:17:51,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 08:17:51,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 08:17:51,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2020-10-20 08:17:51,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:51,242 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2020-10-20 08:17:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2020-10-20 08:17:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-10-20 08:17:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:17:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-10-20 08:17:51,247 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-10-20 08:17:51,247 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-10-20 08:17:51,247 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:17:51,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2020-10-20 08:17:51,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:51,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:51,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:51,248 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:51,249 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:51,249 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 665#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; 666#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 667#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; 659#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; 654#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 655#L537-3 assume !(main_~k~0 < main_~array_size~0); 660#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; 656#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); 657#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); 681#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 664#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 669#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 674#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 652#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 653#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); 675#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); 671#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 662#L523-2 [2020-10-20 08:17:51,249 INFO L796 eck$LassoCheckResult]: Loop: 662#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#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~mem7;havoc test_fun_#t~post8; 662#L523-2 [2020-10-20 08:17:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash 869045162, now seen corresponding path program 1 times [2020-10-20 08:17:51,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:51,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134754187] [2020-10-20 08:17:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:51,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134754187] [2020-10-20 08:17:51,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162616335] [2020-10-20 08:17:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:51,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:17:51,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:51,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:51,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-10-20 08:17:51,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94997941] [2020-10-20 08:17:51,475 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:51,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 4 times [2020-10-20 08:17:51,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:51,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610502201] [2020-10-20 08:17:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:51,479 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:51,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544965153] [2020-10-20 08:17:51,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:51,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 08:17:51,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-20 08:17:51,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:51,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:51,512 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:51,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 08:17:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-20 08:17:51,561 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 14 Second operand 12 states. [2020-10-20 08:17:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:51,839 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2020-10-20 08:17:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 08:17:51,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2020-10-20 08:17:51,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:51,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 34 states and 42 transitions. [2020-10-20 08:17:51,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 08:17:51,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 08:17:51,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2020-10-20 08:17:51,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:51,842 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-20 08:17:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2020-10-20 08:17:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-10-20 08:17:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-20 08:17:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2020-10-20 08:17:51,845 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-10-20 08:17:51,845 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-10-20 08:17:51,845 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:17:51,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2020-10-20 08:17:51,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:51,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:51,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:51,847 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:51,847 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:51,847 INFO L794 eck$LassoCheckResult]: Stem: 828#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 823#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; 824#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 825#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; 816#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; 812#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 813#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; 817#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 836#L537-3 assume !(main_~k~0 < main_~array_size~0); 822#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; 814#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); 815#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); 841#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 821#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 827#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 832#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 833#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 837#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); 834#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; 819#L523-2 [2020-10-20 08:17:51,847 INFO L796 eck$LassoCheckResult]: Loop: 819#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 818#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~mem7;havoc test_fun_#t~post8; 819#L523-2 [2020-10-20 08:17:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash -185139956, now seen corresponding path program 2 times [2020-10-20 08:17:51,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:51,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903978841] [2020-10-20 08:17:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 08:17:51,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903978841] [2020-10-20 08:17:51,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:51,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 08:17:51,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438018613] [2020-10-20 08:17:51,903 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:51,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:51,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 5 times [2020-10-20 08:17:51,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:51,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530473221] [2020-10-20 08:17:51,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:51,906 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:51,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494448536] [2020-10-20 08:17:51,907 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:51,941 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-20 08:17:51,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-20 08:17:51,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:51,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:51,957 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:51,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:17:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:17:51,995 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. cyclomatic complexity: 13 Second operand 6 states. [2020-10-20 08:17:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:52,062 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-10-20 08:17:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:17:52,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2020-10-20 08:17:52,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:52,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 47 transitions. [2020-10-20 08:17:52,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 08:17:52,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 08:17:52,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2020-10-20 08:17:52,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:52,066 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2020-10-20 08:17:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2020-10-20 08:17:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-20 08:17:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 08:17:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2020-10-20 08:17:52,069 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2020-10-20 08:17:52,069 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2020-10-20 08:17:52,069 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:17:52,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2020-10-20 08:17:52,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:52,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:52,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:52,071 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:52,071 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:52,071 INFO L794 eck$LassoCheckResult]: Stem: 912#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 907#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; 908#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 909#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; 900#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; 896#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 897#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; 901#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 921#L537-3 assume !(main_~k~0 < main_~array_size~0); 906#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; 898#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); 899#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); 926#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 910#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 911#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~mem7;havoc test_fun_#t~post8; 929#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 927#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 917#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 918#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 922#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); 919#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); 913#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 903#L523-2 [2020-10-20 08:17:52,071 INFO L796 eck$LassoCheckResult]: Loop: 903#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 902#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~mem7;havoc test_fun_#t~post8; 903#L523-2 [2020-10-20 08:17:52,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2055932007, now seen corresponding path program 1 times [2020-10-20 08:17:52,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:52,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947909736] [2020-10-20 08:17:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:52,080 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:52,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518844285] [2020-10-20 08:17:52,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:52,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:52,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:52,160 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:52,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:52,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 6 times [2020-10-20 08:17:52,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:52,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338570161] [2020-10-20 08:17:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:52,164 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:52,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767634659] [2020-10-20 08:17:52,165 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:52,195 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2020-10-20 08:17:52,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-20 08:17:52,196 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:52,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:52,203 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash 65704044, now seen corresponding path program 2 times [2020-10-20 08:17:52,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:52,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194606123] [2020-10-20 08:17:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:52,215 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-20 08:17:52,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478470395] [2020-10-20 08:17:52,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:52,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:17:52,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-20 08:17:52,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:52,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:52,294 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:53,138 WARN L193 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 137 [2020-10-20 08:17:53,284 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 08:17:53,286 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:53,286 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:53,286 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:53,287 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:53,287 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:53,287 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:53,287 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:53,287 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:53,287 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration9_Lasso [2020-10-20 08:17:53,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:53,287 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:53,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:53,315 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:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) 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:382) 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:320) 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) [2020-10-20 08:17:53,319 INFO L168 Benchmark]: Toolchain (without parser) took 9554.83 ms. Allocated memory was 35.7 MB in the beginning and 98.6 MB in the end (delta: 62.9 MB). Free memory was 7.8 MB in the beginning and 39.1 MB in the end (delta: -31.3 MB). Peak memory consumption was 62.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:53,319 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 35.1 MB. Free memory was 13.8 MB in the beginning and 13.8 MB in the end (delta: 3.1 kB). Peak memory consumption was 3.1 kB. Max. memory is 14.3 GB. [2020-10-20 08:17:53,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.35 ms. Allocated memory was 35.7 MB in the beginning and 45.1 MB in the end (delta: 9.4 MB). Free memory was 6.9 MB in the beginning and 16.3 MB in the end (delta: -9.4 MB). Peak memory consumption was 6.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:53,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.39 ms. Allocated memory was 45.1 MB in the beginning and 46.7 MB in the end (delta: 1.6 MB). Free memory was 16.3 MB in the beginning and 29.2 MB in the end (delta: -12.8 MB). Peak memory consumption was 4.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:53,321 INFO L168 Benchmark]: Boogie Preprocessor took 31.00 ms. Allocated memory is still 46.7 MB. Free memory was 29.2 MB in the beginning and 27.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:53,322 INFO L168 Benchmark]: RCFGBuilder took 421.81 ms. Allocated memory was 46.7 MB in the beginning and 47.2 MB in the end (delta: 524.3 kB). Free memory was 27.5 MB in the beginning and 28.2 MB in the end (delta: -736.2 kB). Peak memory consumption was 18.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:53,323 INFO L168 Benchmark]: BuchiAutomizer took 8436.23 ms. Allocated memory was 47.2 MB in the beginning and 98.6 MB in the end (delta: 51.4 MB). Free memory was 27.9 MB in the beginning and 39.1 MB in the end (delta: -11.1 MB). Peak memory consumption was 71.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:53,326 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 35.1 MB. Free memory was 13.8 MB in the beginning and 13.8 MB in the end (delta: 3.1 kB). Peak memory consumption was 3.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 598.35 ms. Allocated memory was 35.7 MB in the beginning and 45.1 MB in the end (delta: 9.4 MB). Free memory was 6.9 MB in the beginning and 16.3 MB in the end (delta: -9.4 MB). Peak memory consumption was 6.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 57.39 ms. Allocated memory was 45.1 MB in the beginning and 46.7 MB in the end (delta: 1.6 MB). Free memory was 16.3 MB in the beginning and 29.2 MB in the end (delta: -12.8 MB). Peak memory consumption was 4.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.00 ms. Allocated memory is still 46.7 MB. Free memory was 29.2 MB in the beginning and 27.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 421.81 ms. Allocated memory was 46.7 MB in the beginning and 47.2 MB in the end (delta: 524.3 kB). Free memory was 27.5 MB in the beginning and 28.2 MB in the end (delta: -736.2 kB). Peak memory consumption was 18.4 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 8436.23 ms. Allocated memory was 47.2 MB in the beginning and 98.6 MB in the end (delta: 51.4 MB). Free memory was 27.9 MB in the beginning and 39.1 MB in the end (delta: -11.1 MB). Peak memory consumption was 71.0 MB. Max. memory is 14.3 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...