./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 54858612 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.5.800.v20200727-1323.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.2.0-5485861 [2020-10-26 06:01:53,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 06:01:53,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 06:01:53,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 06:01:53,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 06:01:53,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 06:01:53,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 06:01:53,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 06:01:53,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 06:01:53,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 06:01:53,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 06:01:53,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 06:01:53,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 06:01:53,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 06:01:53,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 06:01:53,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 06:01:53,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 06:01:53,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 06:01:53,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 06:01:53,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 06:01:53,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 06:01:53,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 06:01:53,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 06:01:53,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 06:01:53,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 06:01:53,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 06:01:53,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 06:01:53,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 06:01:53,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 06:01:53,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 06:01:53,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 06:01:53,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 06:01:53,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 06:01:53,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 06:01:53,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 06:01:53,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 06:01:53,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 06:01:53,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 06:01:53,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 06:01:53,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 06:01:53,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 06:01:53,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 06:01:53,856 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 06:01:53,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 06:01:53,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 06:01:53,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 06:01:53,861 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 06:01:53,861 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 06:01:53,861 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 06:01:53,862 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 06:01:53,862 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 06:01:53,862 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 06:01:53,863 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 06:01:53,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 06:01:53,864 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 06:01:53,864 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 06:01:53,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 06:01:53,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 06:01:53,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 06:01:53,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 06:01:53,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 06:01:53,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 06:01:53,866 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 06:01:53,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 06:01:53,867 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 06:01:53,867 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 06:01:53,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 06:01:53,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 06:01:53,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 06:01:53,869 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 06:01:53,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 06:01:53,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 06:01:53,869 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 06:01:53,870 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 06:01:53,872 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 06:01:53,872 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-26 06:01:54,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 06:01:54,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 06:01:54,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 06:01:54,331 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 06:01:54,336 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 06:01:54,337 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-26 06:01:54,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c354c5885/4c91fa704617469db0668443c2184d06/FLAGc87ae5a15 [2020-10-26 06:01:55,141 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 06:01:55,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array03-alloca-2.i [2020-10-26 06:01:55,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c354c5885/4c91fa704617469db0668443c2184d06/FLAGc87ae5a15 [2020-10-26 06:01:55,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c354c5885/4c91fa704617469db0668443c2184d06 [2020-10-26 06:01:55,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 06:01:55,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 06:01:55,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 06:01:55,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 06:01:55,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 06:01:55,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:01:55" (1/1) ... [2020-10-26 06:01:55,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64eeec00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:55, skipping insertion in model container [2020-10-26 06:01:55,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:01:55" (1/1) ... [2020-10-26 06:01:55,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 06:01:55,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 06:01:55,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:01:55,897 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 06:01:55,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:01:56,005 INFO L208 MainTranslator]: Completed translation [2020-10-26 06:01:56,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56 WrapperNode [2020-10-26 06:01:56,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 06:01:56,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 06:01:56,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 06:01:56,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 06:01:56,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (1/1) ... [2020-10-26 06:01:56,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (1/1) ... [2020-10-26 06:01:56,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 06:01:56,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 06:01:56,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 06:01:56,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 06:01:56,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (1/1) ... [2020-10-26 06:01:56,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (1/1) ... [2020-10-26 06:01:56,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (1/1) ... [2020-10-26 06:01:56,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (1/1) ... [2020-10-26 06:01:56,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (1/1) ... [2020-10-26 06:01:56,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (1/1) ... [2020-10-26 06:01:56,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (1/1) ... [2020-10-26 06:01:56,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 06:01:56,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 06:01:56,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 06:01:56,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 06:01:56,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (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-26 06:01:56,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 06:01:56,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 06:01:56,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 06:01:56,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 06:01:56,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 06:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 06:01:56,592 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 06:01:56,593 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-26 06:01:56,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:01:56 BoogieIcfgContainer [2020-10-26 06:01:56,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 06:01:56,598 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 06:01:56,599 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 06:01:56,604 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 06:01:56,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:01:56,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 06:01:55" (1/3) ... [2020-10-26 06:01:56,607 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29ddc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:01:56, skipping insertion in model container [2020-10-26 06:01:56,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:01:56,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:01:56" (2/3) ... [2020-10-26 06:01:56,608 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29ddc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:01:56, skipping insertion in model container [2020-10-26 06:01:56,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:01:56,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:01:56" (3/3) ... [2020-10-26 06:01:56,611 INFO L373 chiAutomizerObserver]: Analyzing ICFG array03-alloca-2.i [2020-10-26 06:01:56,694 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 06:01:56,695 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 06:01:56,695 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 06:01:56,695 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 06:01:56,695 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 06:01:56,696 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 06:01:56,696 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 06:01:56,697 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 06:01:56,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-26 06:01:56,790 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-26 06:01:56,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:56,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:56,800 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 06:01:56,800 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:01:56,800 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 06:01:56,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-26 06:01:56,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-26 06:01:56,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:56,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:56,804 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 06:01:56,804 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:01:56,813 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-26 06:01:56,814 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-26 06:01:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-26 06:01:56,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:56,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831890940] [2020-10-26 06:01:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:56,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:56,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:56,985 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:56,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-10-26 06:01:56,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:56,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713881756] [2020-10-26 06:01:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:57,000 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:57,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:57,011 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:57,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:57,013 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-10-26 06:01:57,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:57,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684699984] [2020-10-26 06:01:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:57,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:57,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:57,093 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:57,346 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-10-26 06:01:57,415 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:01:57,416 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:01:57,416 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:01:57,416 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:01:57,417 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:01:57,417 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:57,417 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:01:57,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:01:57,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration1_Lasso [2020-10-26 06:01:57,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:01:57,418 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:01:57,441 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-26 06:01:57,449 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-26 06:01:57,581 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-26 06:01:57,585 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-26 06:01:57,590 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-26 06:01:57,594 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-26 06:01:57,598 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-26 06:01:57,602 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-26 06:01:57,606 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-26 06:01:57,890 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:01:57,896 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) [2020-10-26 06:01:57,906 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-26 06:01:57,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:57,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:57,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:57,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:57,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:57,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:57,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:57,918 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) [2020-10-26 06:01:57,968 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:57,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:57,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:01:57,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:57,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:57,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:57,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:01:57,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:01:57,976 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-26 06:01:58,019 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:58,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:01:58,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:01:58,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:01:58,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:01:58,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:01:58,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:01:58,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:01:58,155 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-26 06:01:58,156 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-26 06:01:58,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:01:58,176 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 06:01:58,177 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:01:58,177 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-26 06:01:58,230 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-10-26 06:01:58,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:01:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:58,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:01:58,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:58,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 06:01:58,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:01:58,355 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-26 06:01:58,379 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-26 06:01:58,381 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-10-26 06:01:58,514 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-26 06:01:58,515 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-26 06:01:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:01:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-10-26 06:01:58,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-26 06:01:58,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:58,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 2 letters. [2020-10-26 06:01:58,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:58,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-26 06:01:58,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:01:58,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2020-10-26 06:01:58,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 06:01:58,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 15 states and 21 transitions. [2020-10-26 06:01:58,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-26 06:01:58,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 06:01:58,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2020-10-26 06:01:58,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:58,559 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-26 06:01:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2020-10-26 06:01:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-26 06:01:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 06:01:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-10-26 06:01:58,605 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-26 06:01:58,606 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-26 06:01:58,606 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 06:01:58,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-10-26 06:01:58,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 06:01:58,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:58,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:58,610 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 06:01:58,610 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-26 06:01:58,611 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-26 06:01:58,611 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-26 06:01:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-10-26 06:01:58,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:58,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108399041] [2020-10-26 06:01:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:01:58,715 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-26 06:01:58,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108399041] [2020-10-26 06:01:58,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:01:58,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 06:01:58,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9388421] [2020-10-26 06:01:58,721 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:01:58,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1807826313, now seen corresponding path program 1 times [2020-10-26 06:01:58,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:58,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443368571] [2020-10-26 06:01:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:58,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:58,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:58,744 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:58,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:01:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 06:01:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 06:01:58,849 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-26 06:01:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:01:58,879 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-10-26 06:01:58,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 06:01:58,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2020-10-26 06:01:58,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 06:01:58,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2020-10-26 06:01:58,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 06:01:58,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 06:01:58,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-10-26 06:01:58,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:01:58,884 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-26 06:01:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-10-26 06:01:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-26 06:01:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 06:01:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-26 06:01:58,886 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-26 06:01:58,887 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-26 06:01:58,887 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 06:01:58,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-26 06:01:58,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 06:01:58,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:01:58,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:01:58,889 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:01:58,889 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-26 06:01:58,889 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-26 06:01:58,890 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-26 06:01:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-10-26 06:01:58,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:58,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105711745] [2020-10-26 06:01:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:58,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:58,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:58,935 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1807826313, now seen corresponding path program 2 times [2020-10-26 06:01:58,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:58,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23136784] [2020-10-26 06:01:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:58,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:58,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:58,954 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:01:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash -260572169, now seen corresponding path program 1 times [2020-10-26 06:01:58,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:01:58,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967654114] [2020-10-26 06:01:58,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:01:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:58,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:01:59,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:01:59,013 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:01:59,314 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2020-10-26 06:01:59,412 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:01:59,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:01:59,412 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:01:59,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:01:59,412 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:01:59,413 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:01:59,413 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:01:59,413 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:01:59,413 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration3_Lasso [2020-10-26 06:01:59,413 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:01:59,413 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:01:59,418 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-26 06:01:59,601 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2020-10-26 06:01:59,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-26 06:01:59,685 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-26 06:01:59,689 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-26 06:01:59,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-26 06:01:59,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-26 06:01:59,699 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-26 06:01:59,704 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-26 06:01:59,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-26 06:01:59,712 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-26 06:01:59,716 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-26 06:01:59,720 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-26 06:01:59,723 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-26 06:01:59,728 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-26 06:01:59,732 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-26 06:01:59,736 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-26 06:01:59,740 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-26 06:01:59,744 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-26 06:01:59,927 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-10-26 06:02:00,290 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:00,291 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-26 06:02:00,298 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-26 06:02:00,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:00,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:00,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:00,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:00,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:00,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:00,320 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:00,353 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-26 06:02:00,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:00,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:00,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:00,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:00,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:00,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:00,365 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:00,391 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-26 06:02:00,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:00,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:00,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:00,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:00,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:00,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:00,429 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:00,478 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-26 06:02:00,478 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-26 06:02:00,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:02:00,493 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:02:00,494 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:00,494 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-26 06:02:00,533 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2020-10-26 06:02:00,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:00,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:02:00,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:00,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:02:00,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:00,639 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-26 06:02:00,640 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-26 06:02:00,640 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-26 06:02:00,676 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-26 06:02:00,676 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-26 06:02:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:02:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2020-10-26 06:02:00,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2020-10-26 06:02:00,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:00,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2020-10-26 06:02:00,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:00,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 12 letters. [2020-10-26 06:02:00,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:00,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2020-10-26 06:02:00,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:00,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 29 transitions. [2020-10-26 06:02:00,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-26 06:02:00,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-26 06:02:00,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2020-10-26 06:02:00,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:00,685 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-26 06:02:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2020-10-26 06:02:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-26 06:02:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-26 06:02:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-10-26 06:02:00,696 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-26 06:02:00,696 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-26 06:02:00,697 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 06:02:00,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-10-26 06:02:00,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:00,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:00,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:00,700 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:00,700 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:00,701 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-26 06:02:00,701 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~post8;havoc test_fun_#t~mem7; 295#L523-2 [2020-10-26 06:02:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811566, now seen corresponding path program 1 times [2020-10-26 06:02:00,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:00,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410849220] [2020-10-26 06:02:00,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:00,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:00,764 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:00,768 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2020-10-26 06:02:00,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:00,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898239078] [2020-10-26 06:02:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:00,778 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:00,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025921770] [2020-10-26 06:02:00,784 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-26 06:02:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:00,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:00,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:00,830 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:00,831 INFO L82 PathProgramCache]: Analyzing trace with hash -357812649, now seen corresponding path program 1 times [2020-10-26 06:02:00,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:00,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942127161] [2020-10-26 06:02:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:00,842 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:00,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187547081] [2020-10-26 06:02:00,843 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-26 06:02:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:00,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:02:00,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:01,073 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-26 06:02:01,075 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:01,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:01,079 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-26 06:02:01,079 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2020-10-26 06:02:01,086 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-26 06:02:01,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942127161] [2020-10-26 06:02:01,087 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-26 06:02:01,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187547081] [2020-10-26 06:02:01,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:01,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 06:02:01,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004233989] [2020-10-26 06:02:01,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 06:02:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 06:02:01,136 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-26 06:02:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:01,203 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-10-26 06:02:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 06:02:01,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2020-10-26 06:02:01,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:01,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 31 transitions. [2020-10-26 06:02:01,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-26 06:02:01,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-26 06:02:01,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2020-10-26 06:02:01,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:01,207 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-26 06:02:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2020-10-26 06:02:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-26 06:02:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 06:02:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-10-26 06:02:01,211 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-26 06:02:01,211 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-26 06:02:01,211 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 06:02:01,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2020-10-26 06:02:01,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:01,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:01,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:01,213 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:01,214 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:01,214 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-26 06:02:01,214 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~post8;havoc test_fun_#t~mem7; 385#L523-2 [2020-10-26 06:02:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2020-10-26 06:02:01,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:01,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114371235] [2020-10-26 06:02:01,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:01,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:01,243 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:01,253 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 2 times [2020-10-26 06:02:01,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:01,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968355495] [2020-10-26 06:02:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:01,262 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:01,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783782658] [2020-10-26 06:02:01,264 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-26 06:02:01,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-26 06:02:01,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-26 06:02:01,309 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:01,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:01,319 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1792764442, now seen corresponding path program 1 times [2020-10-26 06:02:01,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:01,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365841670] [2020-10-26 06:02:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:01,331 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:01,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531790170] [2020-10-26 06:02:01,332 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-26 06:02:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:01,394 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:01,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:01,419 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:01,800 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2020-10-26 06:02:01,944 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-26 06:02:01,949 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:01,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:01,950 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:01,950 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:01,950 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:01,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:01,950 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:01,950 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:01,950 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration5_Lasso [2020-10-26 06:02:01,951 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:01,951 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:01,961 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-26 06:02:01,968 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-26 06:02:01,973 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-26 06:02:01,978 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-26 06:02:01,984 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-26 06:02:01,987 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-26 06:02:01,992 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-26 06:02:01,995 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-26 06:02:02,271 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2020-10-26 06:02:02,364 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-26 06:02:02,367 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-26 06:02:02,371 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-26 06:02:02,374 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-26 06:02:02,377 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-26 06:02:02,391 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-26 06:02:02,395 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-26 06:02:02,400 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-26 06:02:02,405 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-26 06:02:02,610 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-10-26 06:02:03,035 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:03,036 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-26 06:02:03,046 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-26 06:02:03,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:03,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:03,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:03,052 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) [2020-10-26 06:02:03,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-26 06:02:03,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:03,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:03,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:03,101 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-26 06:02:03,144 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-26 06:02:03,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:03,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:03,152 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) [2020-10-26 06:02:03,200 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-26 06:02:03,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:03,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:03,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:03,210 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) [2020-10-26 06:02:03,249 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-26 06:02:03,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:03,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:03,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:03,256 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:03,280 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-26 06:02:03,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:03,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:03,288 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-26 06:02:03,315 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-26 06:02:03,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:03,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:03,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:03,320 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-26 06:02:03,345 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-26 06:02:03,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:03,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:03,357 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-26 06:02:03,382 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-26 06:02:03,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:03,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:03,416 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-26 06:02:03,454 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-26 06:02:03,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:03,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:03,471 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:03,496 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-26 06:02:03,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:03,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:03,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:03,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:03,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:03,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:03,516 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:03,535 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-26 06:02:03,535 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:03,539 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:03,546 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:02:03,546 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:03,546 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0.base) (+ (* ULTIMATE.start_main_~k~0 4) ULTIMATE.start_main_~numbers~0.offset (- 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0.base) (+ (* ULTIMATE.start_main_~k~0 4) ULTIMATE.start_main_~numbers~0.offset (- 4)))_1 Supporting invariants [] [2020-10-26 06:02:03,603 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2020-10-26 06:02:03,609 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 06:02:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:03,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-26 06:02:03,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:03,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 06:02:03,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:03,778 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-26 06:02:03,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-10-26 06:02:03,779 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 6 states. [2020-10-26 06:02:03,993 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 77 states and 103 transitions. Complement of second has 11 states. [2020-10-26 06:02:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2020-10-26 06:02:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 06:02:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2020-10-26 06:02:03,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-26 06:02:03,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:03,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 13 letters. Loop has 2 letters. [2020-10-26 06:02:03,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:03,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-26 06:02:03,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:03,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 103 transitions. [2020-10-26 06:02:04,000 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-26 06:02:04,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 72 states and 96 transitions. [2020-10-26 06:02:04,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-26 06:02:04,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-26 06:02:04,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 96 transitions. [2020-10-26 06:02:04,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:04,005 INFO L691 BuchiCegarLoop]: Abstraction has 72 states and 96 transitions. [2020-10-26 06:02:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 96 transitions. [2020-10-26 06:02:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 32. [2020-10-26 06:02:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-26 06:02:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2020-10-26 06:02:04,010 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2020-10-26 06:02:04,010 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2020-10-26 06:02:04,010 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 06:02:04,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 45 transitions. [2020-10-26 06:02:04,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:04,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:04,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:04,012 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:04,012 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:04,012 INFO L794 eck$LassoCheckResult]: Stem: 601#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 596#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; 597#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 598#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; 587#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; 588#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 589#L537-3 assume !(main_~k~0 < main_~array_size~0); 590#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; 609#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); 607#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); 602#L520 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 592#L523-2 [2020-10-26 06:02:04,012 INFO L796 eck$LassoCheckResult]: Loop: 592#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 591#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 592#L523-2 [2020-10-26 06:02:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383699, now seen corresponding path program 1 times [2020-10-26 06:02:04,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:04,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471133914] [2020-10-26 06:02:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:04,026 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:04,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,041 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 3 times [2020-10-26 06:02:04,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:04,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053046615] [2020-10-26 06:02:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:04,046 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:04,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755564195] [2020-10-26 06:02:04,047 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 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-26 06:02:04,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-10-26 06:02:04,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-26 06:02:04,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:04,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,099 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762520, now seen corresponding path program 1 times [2020-10-26 06:02:04,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:04,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195264909] [2020-10-26 06:02:04,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:04,109 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:04,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202365660] [2020-10-26 06:02:04,110 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-26 06:02:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:04,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:02:04,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:04,188 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-26 06:02:04,190 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:04,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:04,194 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-26 06:02:04,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2020-10-26 06:02:04,201 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-26 06:02:04,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195264909] [2020-10-26 06:02:04,202 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-26 06:02:04,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202365660] [2020-10-26 06:02:04,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:04,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 06:02:04,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742497302] [2020-10-26 06:02:04,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:04,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 06:02:04,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 06:02:04,253 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-10-26 06:02:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:04,345 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2020-10-26 06:02:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 06:02:04,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2020-10-26 06:02:04,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:04,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 44 transitions. [2020-10-26 06:02:04,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 06:02:04,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 06:02:04,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2020-10-26 06:02:04,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:04,349 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-10-26 06:02:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2020-10-26 06:02:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-10-26 06:02:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-26 06:02:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2020-10-26 06:02:04,357 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-10-26 06:02:04,357 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-10-26 06:02:04,357 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 06:02:04,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2020-10-26 06:02:04,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:04,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:04,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:04,363 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:04,363 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:04,363 INFO L794 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 712#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; 713#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 714#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; 705#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; 699#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 700#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; 706#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 725#L537-3 assume !(main_~k~0 < main_~array_size~0); 724#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; 723#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); 704#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); 718#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 709#L523-2 [2020-10-26 06:02:04,364 INFO L796 eck$LassoCheckResult]: Loop: 709#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 708#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 709#L523-2 [2020-10-26 06:02:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash -856885645, now seen corresponding path program 2 times [2020-10-26 06:02:04,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:04,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402452068] [2020-10-26 06:02:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:04,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:04,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,406 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:04,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:04,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 4 times [2020-10-26 06:02:04,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:04,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470406685] [2020-10-26 06:02:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:04,411 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:04,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442415963] [2020-10-26 06:02:04,412 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-26 06:02:04,454 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 06:02:04,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-26 06:02:04,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:04,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1166617464, now seen corresponding path program 2 times [2020-10-26 06:02:04,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:04,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291877362] [2020-10-26 06:02:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:04,475 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:04,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656140034] [2020-10-26 06:02:04,476 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 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-26 06:02:04,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:02:04,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-26 06:02:04,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:04,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:04,576 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:05,014 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 96 [2020-10-26 06:02:05,137 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-26 06:02:05,141 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:05,141 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:05,141 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:05,141 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:05,141 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:05,141 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:05,141 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:05,141 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:05,141 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration7_Lasso [2020-10-26 06:02:05,141 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:05,141 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:05,162 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-26 06:02:05,368 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-10-26 06:02:05,447 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-26 06:02:05,456 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-26 06:02:05,460 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-26 06:02:05,464 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-26 06:02:05,467 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-26 06:02:05,471 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-26 06:02:05,474 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-26 06:02:05,478 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-26 06:02:05,487 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-26 06:02:05,500 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-26 06:02:05,503 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-26 06:02:05,506 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-26 06:02:05,509 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-26 06:02:05,513 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-26 06:02:05,516 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-26 06:02:05,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-26 06:02:05,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-26 06:02:05,740 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-10-26 06:02:06,070 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:06,070 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:06,076 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-26 06:02:06,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:06,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:06,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:06,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:06,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:06,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:06,091 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:06,113 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-26 06:02:06,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:06,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:06,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:06,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:06,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:06,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:06,129 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:06,153 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-26 06:02:06,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:06,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:06,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:06,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:06,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:06,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:06,178 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:06,192 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-26 06:02:06,192 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:06,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:06,204 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:02:06,204 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:06,204 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_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2020-10-26 06:02:06,244 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-26 06:02:06,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 06:02:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:06,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:02:06,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:06,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 06:02:06,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:06,332 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-26 06:02:06,333 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-26 06:02:06,333 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-10-26 06:02:06,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 51 states and 68 transitions. Complement of second has 7 states. [2020-10-26 06:02:06,365 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-26 06:02:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:02:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-10-26 06:02:06,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 2 letters. [2020-10-26 06:02:06,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:06,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 2 letters. [2020-10-26 06:02:06,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:06,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2020-10-26 06:02:06,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:06,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 68 transitions. [2020-10-26 06:02:06,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:06,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 55 transitions. [2020-10-26 06:02:06,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 06:02:06,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 06:02:06,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 55 transitions. [2020-10-26 06:02:06,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:06,375 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-10-26 06:02:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 55 transitions. [2020-10-26 06:02:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2020-10-26 06:02:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-26 06:02:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-10-26 06:02:06,384 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-10-26 06:02:06,384 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-10-26 06:02:06,384 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 06:02:06,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2020-10-26 06:02:06,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:06,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:06,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:06,388 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:06,389 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:06,389 INFO L794 eck$LassoCheckResult]: Stem: 889#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 884#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; 885#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 886#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; 878#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; 873#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 874#L537-3 assume !(main_~k~0 < main_~array_size~0); 879#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; 875#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); 876#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); 900#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 883#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 888#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 893#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 871#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 872#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); 894#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); 890#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 881#L523-2 [2020-10-26 06:02:06,389 INFO L796 eck$LassoCheckResult]: Loop: 881#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 880#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 881#L523-2 [2020-10-26 06:02:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash 869045162, now seen corresponding path program 1 times [2020-10-26 06:02:06,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:06,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548495421] [2020-10-26 06:02:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:06,540 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-26 06:02:06,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548495421] [2020-10-26 06:02:06,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962591684] [2020-10-26 06:02:06,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:06,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:02:06,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:06,722 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-26 06:02:06,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:02:06,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-10-26 06:02:06,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819038185] [2020-10-26 06:02:06,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:06,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 5 times [2020-10-26 06:02:06,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:06,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063905805] [2020-10-26 06:02:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:06,728 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:06,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102258830] [2020-10-26 06:02:06,728 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:06,763 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-26 06:02:06,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-26 06:02:06,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:06,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:06,771 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:06,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:06,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 06:02:06,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-26 06:02:06,818 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 14 Second operand 12 states. [2020-10-26 06:02:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:07,150 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2020-10-26 06:02:07,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 06:02:07,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2020-10-26 06:02:07,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:07,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 34 states and 42 transitions. [2020-10-26 06:02:07,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-26 06:02:07,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-26 06:02:07,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2020-10-26 06:02:07,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:07,154 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-10-26 06:02:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2020-10-26 06:02:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-10-26 06:02:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-26 06:02:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2020-10-26 06:02:07,157 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-10-26 06:02:07,157 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-10-26 06:02:07,157 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 06:02:07,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2020-10-26 06:02:07,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:07,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:07,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:07,159 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:07,159 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:07,159 INFO L794 eck$LassoCheckResult]: Stem: 1047#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1042#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; 1043#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1044#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; 1035#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; 1031#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 1032#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; 1036#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 1055#L537-3 assume !(main_~k~0 < main_~array_size~0); 1041#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; 1033#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); 1034#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); 1060#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 1040#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1046#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1051#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1052#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 1056#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); 1053#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); 1048#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 1038#L523-2 [2020-10-26 06:02:07,159 INFO L796 eck$LassoCheckResult]: Loop: 1038#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1037#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 1038#L523-2 [2020-10-26 06:02:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash -185139956, now seen corresponding path program 2 times [2020-10-26 06:02:07,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:07,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303816808] [2020-10-26 06:02:07,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:07,232 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-26 06:02:07,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303816808] [2020-10-26 06:02:07,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:07,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 06:02:07,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972675004] [2020-10-26 06:02:07,233 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:07,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 6 times [2020-10-26 06:02:07,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:07,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46241041] [2020-10-26 06:02:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:07,237 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:07,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706237221] [2020-10-26 06:02:07,238 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:07,273 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2020-10-26 06:02:07,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-26 06:02:07,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:07,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:07,282 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:07,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 06:02:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 06:02:07,328 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. cyclomatic complexity: 13 Second operand 6 states. [2020-10-26 06:02:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:07,408 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-10-26 06:02:07,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 06:02:07,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2020-10-26 06:02:07,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:07,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 47 transitions. [2020-10-26 06:02:07,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 06:02:07,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 06:02:07,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2020-10-26 06:02:07,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:07,411 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2020-10-26 06:02:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2020-10-26 06:02:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-26 06:02:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-26 06:02:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2020-10-26 06:02:07,414 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2020-10-26 06:02:07,414 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2020-10-26 06:02:07,414 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 06:02:07,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2020-10-26 06:02:07,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 06:02:07,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:07,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:07,416 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:07,416 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:07,416 INFO L794 eck$LassoCheckResult]: Stem: 1131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1126#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; 1127#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1128#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; 1119#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; 1115#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 1116#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; 1120#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 1140#L537-3 assume !(main_~k~0 < main_~array_size~0); 1125#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; 1117#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); 1118#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); 1146#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 1129#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1130#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 1148#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1143#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1142#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1141#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 1139#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); 1137#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); 1133#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 1122#L523-2 [2020-10-26 06:02:07,416 INFO L796 eck$LassoCheckResult]: Loop: 1122#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1121#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 1122#L523-2 [2020-10-26 06:02:07,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2055932007, now seen corresponding path program 1 times [2020-10-26 06:02:07,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:07,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997544910] [2020-10-26 06:02:07,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:07,425 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:07,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381245083] [2020-10-26 06:02:07,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:07,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:07,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:07,541 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 7 times [2020-10-26 06:02:07,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:07,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308276938] [2020-10-26 06:02:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:07,546 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:07,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821065625] [2020-10-26 06:02:07,547 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:07,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:07,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:07,614 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash 65704044, now seen corresponding path program 2 times [2020-10-26 06:02:07,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:07,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480410034] [2020-10-26 06:02:07,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:07,623 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-26 06:02:07,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2022866762] [2020-10-26 06:02:07,624 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:07,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:02:07,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-26 06:02:07,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:07,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:07,726 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:08,788 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 172 DAG size of output: 133 [2020-10-26 06:02:08,975 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-26 06:02:08,978 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:08,978 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:08,978 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:08,978 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:08,978 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:08,979 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:08,979 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:08,979 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:08,979 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration10_Lasso [2020-10-26 06:02:08,979 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:08,979 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:08,983 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-26 06:02:08,996 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-26 06:02:09,003 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-26 06:02:09,006 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-26 06:02:09,009 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-26 06:02:09,013 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-26 06:02:09,022 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-26 06:02:09,025 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-26 06:02:09,028 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-26 06:02:09,031 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-26 06:02:09,063 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:63) [2020-10-26 06:02:09,066 INFO L168 Benchmark]: Toolchain (without parser) took 13605.18 ms. Allocated memory was 48.2 MB in the beginning and 161.5 MB in the end (delta: 113.2 MB). Free memory was 33.0 MB in the beginning and 77.8 MB in the end (delta: -44.8 MB). Peak memory consumption was 100.3 MB. Max. memory is 16.1 GB. [2020-10-26 06:02:09,066 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 39.8 MB. Free memory is still 26.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:02:09,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.34 ms. Allocated memory is still 48.2 MB. Free memory was 32.3 MB in the beginning and 23.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. [2020-10-26 06:02:09,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.31 ms. Allocated memory is still 48.2 MB. Free memory was 23.1 MB in the beginning and 21.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 06:02:09,068 INFO L168 Benchmark]: Boogie Preprocessor took 32.65 ms. Allocated memory is still 48.2 MB. Free memory was 21.2 MB in the beginning and 20.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:02:09,068 INFO L168 Benchmark]: RCFGBuilder took 500.76 ms. Allocated memory is still 48.2 MB. Free memory was 19.9 MB in the beginning and 29.1 MB in the end (delta: -9.2 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. [2020-10-26 06:02:09,069 INFO L168 Benchmark]: BuchiAutomizer took 12466.68 ms. Allocated memory was 48.2 MB in the beginning and 161.5 MB in the end (delta: 113.2 MB). Free memory was 29.1 MB in the beginning and 77.8 MB in the end (delta: -48.7 MB). Peak memory consumption was 96.2 MB. Max. memory is 16.1 GB. [2020-10-26 06:02:09,072 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.31 ms. Allocated memory is still 39.8 MB. Free memory is still 26.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 537.34 ms. Allocated memory is still 48.2 MB. Free memory was 32.3 MB in the beginning and 23.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.31 ms. Allocated memory is still 48.2 MB. Free memory was 23.1 MB in the beginning and 21.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.65 ms. Allocated memory is still 48.2 MB. Free memory was 21.2 MB in the beginning and 20.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 500.76 ms. Allocated memory is still 48.2 MB. Free memory was 19.9 MB in the beginning and 29.1 MB in the end (delta: -9.2 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 12466.68 ms. Allocated memory was 48.2 MB in the beginning and 161.5 MB in the end (delta: 113.2 MB). Free memory was 29.1 MB in the beginning and 77.8 MB in the end (delta: -48.7 MB). Peak memory consumption was 96.2 MB. Max. memory is 16.1 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 - 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...