./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/lis-alloca-1.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 111460b358d4c09612932eb239746dbb8202adb9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 20:25:35,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:25:35,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:25:35,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:25:35,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:25:35,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:25:35,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:25:35,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:25:35,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:25:35,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:25:35,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:25:35,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:25:35,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:25:35,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:25:35,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:25:35,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:25:35,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:25:35,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:25:35,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:25:35,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:25:35,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:25:35,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:25:35,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:25:35,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:25:35,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:25:35,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:25:35,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:25:35,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:25:35,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:25:35,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:25:35,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:25:35,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:25:35,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:25:35,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:25:35,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:25:35,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:25:35,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:25:35,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:25:35,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:25:35,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:25:35,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:25:35,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:25:35,929 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:25:35,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:25:35,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:25:35,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:25:35,931 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:25:35,931 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:25:35,931 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:25:35,931 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:25:35,932 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:25:35,932 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:25:35,932 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:25:35,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:25:35,932 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:25:35,933 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:25:35,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:25:35,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:25:35,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:25:35,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:25:35,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:25:35,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:25:35,934 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:25:35,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:25:35,935 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:25:35,935 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:25:35,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:25:35,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:25:35,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:25:35,936 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:25:35,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:25:35,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:25:35,936 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:25:35,937 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:25:35,938 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:25:35,938 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 111460b358d4c09612932eb239746dbb8202adb9 [2020-10-19 20:25:36,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:25:36,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:25:36,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:25:36,322 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:25:36,325 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:25:36,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-10-19 20:25:36,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15422e666/16e1bf1eecf0405f803a3cb6252e8ce1/FLAG9fb0a522c [2020-10-19 20:25:36,888 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:25:36,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2020-10-19 20:25:36,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15422e666/16e1bf1eecf0405f803a3cb6252e8ce1/FLAG9fb0a522c [2020-10-19 20:25:37,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15422e666/16e1bf1eecf0405f803a3cb6252e8ce1 [2020-10-19 20:25:37,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:25:37,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:25:37,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:25:37,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:25:37,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:25:37,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a659b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37, skipping insertion in model container [2020-10-19 20:25:37,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:25:37,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:25:37,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:25:37,699 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:25:37,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:25:37,832 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:25:37,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37 WrapperNode [2020-10-19 20:25:37,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:25:37,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:25:37,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:25:37,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:25:37,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:25:37,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:25:37,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:25:37,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:25:37,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:37,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (1/1) ... [2020-10-19 20:25:38,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:25:38,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:25:38,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:25:38,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:25:38,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (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-19 20:25:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:25:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:25:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:25:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:25:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:25:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:25:38,562 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:25:38,562 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-10-19 20:25:38,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:25:38 BoogieIcfgContainer [2020-10-19 20:25:38,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:25:38,565 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:25:38,565 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:25:38,573 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:25:38,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:38,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:25:37" (1/3) ... [2020-10-19 20:25:38,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fe24912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:25:38, skipping insertion in model container [2020-10-19 20:25:38,578 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:38,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:37" (2/3) ... [2020-10-19 20:25:38,580 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fe24912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:25:38, skipping insertion in model container [2020-10-19 20:25:38,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:38,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:25:38" (3/3) ... [2020-10-19 20:25:38,588 INFO L373 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2020-10-19 20:25:38,646 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:25:38,646 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:25:38,647 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:25:38,647 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:25:38,647 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:25:38,647 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:25:38,647 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:25:38,647 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:25:38,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-10-19 20:25:38,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-10-19 20:25:38,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:38,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:38,692 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 20:25:38,692 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:38,692 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:25:38,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-10-19 20:25:38,695 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2020-10-19 20:25:38,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:38,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:38,696 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 20:25:38,696 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:38,703 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 15#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 20#L530-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 23#L535-3true [2020-10-19 20:25:38,703 INFO L796 eck$LassoCheckResult]: Loop: 23#L535-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 10#L535-2true main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 23#L535-3true [2020-10-19 20:25:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-19 20:25:38,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:38,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658057732] [2020-10-19 20:25:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,871 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:38,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:38,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-10-19 20:25:38,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:38,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622743813] [2020-10-19 20:25:38,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,896 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:38,898 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-10-19 20:25:38,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:38,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852885939] [2020-10-19 20:25:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,977 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:39,180 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-10-19 20:25:39,279 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:39,280 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:39,280 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:39,281 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:39,281 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:39,281 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:39,281 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:39,282 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:39,282 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2020-10-19 20:25:39,282 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:39,283 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:39,315 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-19 20:25:39,329 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-19 20:25:39,334 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-19 20:25:39,341 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-19 20:25:39,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:39,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:39,521 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-19 20:25:39,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:39,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:39,538 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-19 20:25:39,869 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:39,875 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-19 20:25:39,890 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-19 20:25:39,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,900 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-19 20:25:39,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:39,950 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-19 20:25:39,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:39,958 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-19 20:25:40,002 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-19 20:25:40,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:40,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:40,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:40,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:40,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:40,020 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:40,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:40,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:40,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:40,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:40,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:40,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:40,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:40,077 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 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-19 20:25:40,110 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-19 20:25:40,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:40,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:40,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:40,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:40,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:40,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:40,146 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:40,191 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 20:25:40,192 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:40,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,204 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 20:25:40,205 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:40,206 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -4*ULTIMATE.start_main_~i~1 + 2147483637 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 + 1*ULTIMATE.start_main_~numbers~0.offset + 2147483640 >= 0] [2020-10-19 20:25:40,280 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 20:25:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:40,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:25:40,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:40,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:25:40,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:40,465 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-19 20:25:40,484 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 20:25:40,486 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2020-10-19 20:25:40,611 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 47 states and 74 transitions. Complement of second has 9 states. [2020-10-19 20:25:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:25:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 20:25:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-10-19 20:25:40,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-19 20:25:40,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:40,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2020-10-19 20:25:40,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:40,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-19 20:25:40,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:40,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2020-10-19 20:25:40,637 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 20:25:40,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2020-10-19 20:25:40,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-19 20:25:40,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-19 20:25:40,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2020-10-19 20:25:40,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:40,648 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-10-19 20:25:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2020-10-19 20:25:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-19 20:25:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-19 20:25:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-10-19 20:25:40,689 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-10-19 20:25:40,689 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-10-19 20:25:40,689 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:25:40,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2020-10-19 20:25:40,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 20:25:40,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:40,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:40,694 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:25:40,694 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:40,695 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 155#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 156#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 160#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 153#L535-3 assume !(main_~i~1 < main_~array_size~0); 154#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 146#L517-3 [2020-10-19 20:25:40,695 INFO L796 eck$LassoCheckResult]: Loop: 146#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 145#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 146#L517-3 [2020-10-19 20:25:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:40,696 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-10-19 20:25:40,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:40,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972059580] [2020-10-19 20:25:40,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:40,832 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-19 20:25:40,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972059580] [2020-10-19 20:25:40,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:40,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:25:40,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727688464] [2020-10-19 20:25:40,840 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2020-10-19 20:25:40,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:40,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360166219] [2020-10-19 20:25:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:40,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:40,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:40,886 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:40,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:40,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:25:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:25:40,976 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-10-19 20:25:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:41,025 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-10-19 20:25:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:25:41,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2020-10-19 20:25:41,028 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 20:25:41,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2020-10-19 20:25:41,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-19 20:25:41,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-19 20:25:41,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-10-19 20:25:41,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:41,035 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-19 20:25:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-10-19 20:25:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-10-19 20:25:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-19 20:25:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-10-19 20:25:41,045 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-19 20:25:41,046 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-19 20:25:41,046 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:25:41,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-10-19 20:25:41,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 20:25:41,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:41,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:41,049 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:41,050 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:41,050 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 203#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 204#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 210#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 205#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 201#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 202#L535-3 assume !(main_~i~1 < main_~array_size~0); 206#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 196#L517-3 [2020-10-19 20:25:41,050 INFO L796 eck$LassoCheckResult]: Loop: 196#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 195#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 196#L517-3 [2020-10-19 20:25:41,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:41,051 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-10-19 20:25:41,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:41,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721489032] [2020-10-19 20:25:41,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:41,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:41,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:41,144 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2020-10-19 20:25:41,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:41,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878241596] [2020-10-19 20:25:41,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:41,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:41,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:41,186 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2020-10-19 20:25:41,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:41,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547068497] [2020-10-19 20:25:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:41,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:41,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:41,292 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:41,859 WARN L193 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2020-10-19 20:25:42,072 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-19 20:25:42,076 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:42,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:42,077 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:42,077 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:42,077 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:42,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:42,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:42,078 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:42,078 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2020-10-19 20:25:42,078 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:42,078 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:42,092 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-19 20:25:42,097 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-19 20:25:42,107 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-19 20:25:42,114 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-19 20:25:42,116 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-19 20:25:42,119 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-19 20:25:42,121 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-19 20:25:42,505 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2020-10-19 20:25:42,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-19 20:25:42,597 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-19 20:25:42,600 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-19 20:25:42,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-19 20:25:42,605 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-19 20:25:42,608 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-19 20:25:42,611 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-19 20:25:42,614 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-19 20:25:42,616 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-19 20:25:42,619 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-19 20:25:42,621 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-19 20:25:42,624 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-19 20:25:42,627 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-19 20:25:42,630 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-19 20:25:42,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:42,635 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-19 20:25:42,638 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-19 20:25:42,641 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-19 20:25:42,644 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-19 20:25:42,876 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-10-19 20:25:43,339 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:43,340 INFO L489 LassoAnalysis]: Using template 'affine'. 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-19 20:25:43,359 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-19 20:25:43,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:43,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:43,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:43,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:43,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:43,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:43,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:43,364 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 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-19 20:25:43,392 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-19 20:25:43,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:43,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:43,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:43,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:43,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:43,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:43,403 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 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:43,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:43,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:43,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:43,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:43,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:43,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:43,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:43,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:43,440 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:43,488 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-19 20:25:43,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:43,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:43,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:43,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:43,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:43,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:43,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:43,498 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:43,527 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-19 20:25:43,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:43,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:43,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:43,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:43,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:43,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:43,544 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 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:43,584 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-19 20:25:43,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:43,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:43,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:43,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:43,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:43,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:43,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:43,588 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 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-19 20:25:43,613 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-19 20:25:43,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:43,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:43,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:43,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:43,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:43,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:43,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:43,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:43,647 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-19 20:25:43,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:43,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:43,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:43,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:43,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:43,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:43,691 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:43,751 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-10-19 20:25:43,752 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. 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-19 20:25:43,754 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:25:43,762 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:25:43,763 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:43,763 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-10-19 20:25:43,853 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2020-10-19 20:25:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:43,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:25:43,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:43,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:43,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:43,907 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-19 20:25:43,908 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-19 20:25:43,908 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-19 20:25:43,929 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 24 states and 35 transitions. Complement of second has 7 states. [2020-10-19 20:25:43,930 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-19 20:25:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:25:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-19 20:25:43,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2020-10-19 20:25:43,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:43,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-19 20:25:43,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:43,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-10-19 20:25:43,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:43,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-10-19 20:25:43,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-19 20:25:43,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2020-10-19 20:25:43,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:25:43,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:25:43,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-10-19 20:25:43,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:43,935 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-10-19 20:25:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-10-19 20:25:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-19 20:25:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-19 20:25:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-10-19 20:25:43,937 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-10-19 20:25:43,937 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-10-19 20:25:43,937 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:25:43,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-10-19 20:25:43,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-19 20:25:43,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:43,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:43,939 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:43,939 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:43,939 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 375#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 376#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 382#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 377#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 373#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 374#L535-3 assume !(main_~i~1 < main_~array_size~0); 378#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 369#L517-3 assume !(lis_~i~0 < lis_~N); 370#L517-4 lis_~i~0 := 1; 363#L519-3 [2020-10-19 20:25:43,940 INFO L796 eck$LassoCheckResult]: Loop: 363#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 365#L520-3 assume !(lis_~j~0 < lis_~i~0); 384#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 363#L519-3 [2020-10-19 20:25:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2020-10-19 20:25:43,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:43,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327251861] [2020-10-19 20:25:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:43,975 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-19 20:25:43,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327251861] [2020-10-19 20:25:43,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:43,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:25:43,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859063864] [2020-10-19 20:25:43,976 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:43,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:43,977 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2020-10-19 20:25:43,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:43,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611372944] [2020-10-19 20:25:43,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:43,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:43,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:43,984 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:43,999 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:44,000 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:44,000 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:44,000 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:44,000 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 20:25:44,000 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,000 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:44,000 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:44,001 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-10-19 20:25:44,001 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:44,001 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:44,002 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-19 20:25:44,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-19 20:25:44,010 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-19 20:25:44,018 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-19 20:25:44,021 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-19 20:25:44,084 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:44,085 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:25:44,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 20:25:44,096 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:25:44,096 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:25:44,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 20:25:44,122 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:25:44,122 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-19 20:25:44,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:25:44,147 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2020-10-19 20:25:44,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 20:25:44,203 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,432 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 20:25:44,435 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:44,435 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:44,435 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:44,435 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:44,435 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:44,436 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,436 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:44,436 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:44,436 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2020-10-19 20:25:44,436 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:44,437 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:44,438 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-19 20:25:44,444 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-19 20:25:44,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-19 20:25:44,461 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-19 20:25:44,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-19 20:25:44,528 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:44,528 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 20:25:44,550 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-19 20:25:44,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:44,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:44,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:44,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:44,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:44,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,561 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) [2020-10-19 20:25:44,612 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-19 20:25:44,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:44,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:44,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:44,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:44,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:44,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:44,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-10-19 20:25:44,678 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-19 20:25:44,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:44,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:44,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:44,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:44,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:44,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:44,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:44,685 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,691 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-19 20:25:44,691 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:25:44,694 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 20:25:44,694 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:44,695 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-10-19 20:25:44,716 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 20:25:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:44,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:25:44,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:44,763 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:44,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:44,775 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-19 20:25:44,776 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-19 20:25:44,776 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 20:25:44,810 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 46 transitions. Complement of second has 7 states. [2020-10-19 20:25:44,811 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-19 20:25:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:25:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-10-19 20:25:44,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2020-10-19 20:25:44,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:44,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 3 letters. [2020-10-19 20:25:44,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:44,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-19 20:25:44,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:44,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 46 transitions. [2020-10-19 20:25:44,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:44,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 42 transitions. [2020-10-19 20:25:44,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 20:25:44,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:25:44,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2020-10-19 20:25:44,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:44,815 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-10-19 20:25:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2020-10-19 20:25:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-19 20:25:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 20:25:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-10-19 20:25:44,818 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-10-19 20:25:44,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:44,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:25:44,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:25:44,819 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2020-10-19 20:25:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:44,898 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2020-10-19 20:25:44,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:25:44,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2020-10-19 20:25:44,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:44,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 41 transitions. [2020-10-19 20:25:44,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:25:44,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:25:44,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 41 transitions. [2020-10-19 20:25:44,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:44,903 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2020-10-19 20:25:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 41 transitions. [2020-10-19 20:25:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-19 20:25:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 20:25:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-10-19 20:25:44,906 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-10-19 20:25:44,906 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-10-19 20:25:44,906 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:25:44,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-10-19 20:25:44,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:44,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:44,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:44,908 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:44,908 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:25:44,908 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 549#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 550#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 558#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 551#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 547#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 548#L535-3 assume !(main_~i~1 < main_~array_size~0); 552#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 543#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 540#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 541#L517-3 assume !(lis_~i~0 < lis_~N); 544#L517-4 lis_~i~0 := 1; 535#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 538#L520-3 [2020-10-19 20:25:44,908 INFO L796 eck$LassoCheckResult]: Loop: 538#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 553#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 554#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7; 559#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 538#L520-3 [2020-10-19 20:25:44,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2020-10-19 20:25:44,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:44,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391257751] [2020-10-19 20:25:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:44,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391257751] [2020-10-19 20:25:44,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132188251] [2020-10-19 20:25:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:45,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 20:25:45,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:45,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:45,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2020-10-19 20:25:45,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233411418] [2020-10-19 20:25:45,165 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2020-10-19 20:25:45,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:45,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395765004] [2020-10-19 20:25:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:45,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:45,199 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:45,201 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:45,331 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-19 20:25:45,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:45,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 20:25:45,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-19 20:25:45,366 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. cyclomatic complexity: 18 Second operand 10 states. [2020-10-19 20:25:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:45,663 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2020-10-19 20:25:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-19 20:25:45,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 94 transitions. [2020-10-19 20:25:45,667 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 20:25:45,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 66 transitions. [2020-10-19 20:25:45,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-19 20:25:45,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-19 20:25:45,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 66 transitions. [2020-10-19 20:25:45,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:45,668 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 66 transitions. [2020-10-19 20:25:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 66 transitions. [2020-10-19 20:25:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-10-19 20:25:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 20:25:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-19 20:25:45,672 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-19 20:25:45,672 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-19 20:25:45,672 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:25:45,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-10-19 20:25:45,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:45,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:45,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:45,674 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:45,674 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:25:45,674 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 710#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 711#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 720#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 712#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 708#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 709#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 713#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 724#L535-3 assume !(main_~i~1 < main_~array_size~0); 719#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 702#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 703#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 704#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 699#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 700#L517-3 assume !(lis_~i~0 < lis_~N); 707#L517-4 lis_~i~0 := 1; 694#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 696#L520-3 [2020-10-19 20:25:45,674 INFO L796 eck$LassoCheckResult]: Loop: 696#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 714#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 715#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7; 721#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 696#L520-3 [2020-10-19 20:25:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2020-10-19 20:25:45,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:45,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113736035] [2020-10-19 20:25:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:45,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:45,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:45,720 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:45,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2020-10-19 20:25:45,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:45,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791316671] [2020-10-19 20:25:45,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:45,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:45,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:45,735 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:45,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2020-10-19 20:25:45,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:45,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664293759] [2020-10-19 20:25:45,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:46,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664293759] [2020-10-19 20:25:46,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497576786] [2020-10-19 20:25:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:46,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-19 20:25:46,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:46,168 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2020-10-19 20:25:46,170 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:25:46,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:46,174 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 20:25:46,174 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-10-19 20:25:46,224 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:46,224 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-10-19 20:25:46,226 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:25:46,234 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:46,236 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:25:46,236 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:8 [2020-10-19 20:25:46,258 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-10-19 20:25:46,259 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:25:46,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:46,267 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:25:46,267 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2020-10-19 20:25:46,367 INFO L350 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2020-10-19 20:25:46,368 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 41 [2020-10-19 20:25:46,369 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:25:46,379 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:46,382 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 20:25:46,383 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2020-10-19 20:25:46,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:25:46,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 20:25:46,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 20:25:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-19 20:25:46,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:46,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-10-19 20:25:46,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712343619] [2020-10-19 20:25:46,759 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-19 20:25:46,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-19 20:25:46,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-19 20:25:46,791 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 17 states. [2020-10-19 20:25:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:47,510 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2020-10-19 20:25:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-19 20:25:47,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2020-10-19 20:25:47,514 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 18 [2020-10-19 20:25:47,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 98 transitions. [2020-10-19 20:25:47,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-19 20:25:47,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-19 20:25:47,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 98 transitions. [2020-10-19 20:25:47,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:47,522 INFO L691 BuchiCegarLoop]: Abstraction has 68 states and 98 transitions. [2020-10-19 20:25:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 98 transitions. [2020-10-19 20:25:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2020-10-19 20:25:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-19 20:25:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2020-10-19 20:25:47,534 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-10-19 20:25:47,534 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-10-19 20:25:47,534 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:25:47,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 56 transitions. [2020-10-19 20:25:47,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:47,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:47,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:47,536 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:47,537 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:25:47,538 INFO L794 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 911#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 912#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 922#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 913#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 909#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 910#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 914#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 928#L535-3 assume !(main_~i~1 < main_~array_size~0); 921#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 902#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 903#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 904#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 899#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 900#L517-3 assume !(lis_~i~0 < lis_~N); 907#L517-4 lis_~i~0 := 1; 908#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 933#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 934#L521 assume !lis_#t~short11; 916#L521-2 [2020-10-19 20:25:47,538 INFO L796 eck$LassoCheckResult]: Loop: 916#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7; 924#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 896#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 915#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 916#L521-2 [2020-10-19 20:25:47,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1570854005, now seen corresponding path program 1 times [2020-10-19 20:25:47,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:47,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835934709] [2020-10-19 20:25:47,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:47,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:47,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:47,673 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:47,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2895270, now seen corresponding path program 3 times [2020-10-19 20:25:47,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:47,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072560618] [2020-10-19 20:25:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:47,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:47,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:47,700 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:47,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:47,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1264986138, now seen corresponding path program 1 times [2020-10-19 20:25:47,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:47,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412439801] [2020-10-19 20:25:47,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-19 20:25:47,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412439801] [2020-10-19 20:25:47,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149131173] [2020-10-19 20:25:47,776 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-19 20:25:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:47,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:47,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-19 20:25:47,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 20:25:47,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-10-19 20:25:47,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983904362] [2020-10-19 20:25:47,991 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-10-19 20:25:48,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:48,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:25:48,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-19 20:25:48,055 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-10-19 20:25:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:48,126 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2020-10-19 20:25:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:25:48,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 76 transitions. [2020-10-19 20:25:48,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:48,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 48 states and 64 transitions. [2020-10-19 20:25:48,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-19 20:25:48,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-19 20:25:48,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-10-19 20:25:48,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:48,130 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-10-19 20:25:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-10-19 20:25:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2020-10-19 20:25:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-19 20:25:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-19 20:25:48,133 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-19 20:25:48,134 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-19 20:25:48,134 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:25:48,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2020-10-19 20:25:48,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:48,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:48,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:48,135 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:48,135 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:25:48,135 INFO L794 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1087#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1088#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1098#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1089#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1085#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1086#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1090#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1104#L535-3 assume !(main_~i~1 < main_~array_size~0); 1097#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1079#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1076#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1077#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1080#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1105#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1106#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1110#L517-3 assume !(lis_~i~0 < lis_~N); 1109#L517-4 lis_~i~0 := 1; 1070#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1071#L520-3 assume !(lis_~j~0 < lis_~i~0); 1103#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1072#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1074#L520-3 [2020-10-19 20:25:48,136 INFO L796 eck$LassoCheckResult]: Loop: 1074#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1091#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1092#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7; 1099#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1074#L520-3 [2020-10-19 20:25:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1189567124, now seen corresponding path program 1 times [2020-10-19 20:25:48,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:48,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861692878] [2020-10-19 20:25:48,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-19 20:25:48,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861692878] [2020-10-19 20:25:48,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:48,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:25:48,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954234808] [2020-10-19 20:25:48,195 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:48,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:48,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 4 times [2020-10-19 20:25:48,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:48,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456736032] [2020-10-19 20:25:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:48,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:48,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:48,208 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:48,310 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-19 20:25:48,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:48,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:25:48,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:25:48,348 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-10-19 20:25:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:48,406 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-10-19 20:25:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:25:48,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 58 transitions. [2020-10-19 20:25:48,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:48,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 58 transitions. [2020-10-19 20:25:48,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-19 20:25:48,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-19 20:25:48,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 58 transitions. [2020-10-19 20:25:48,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:48,410 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-10-19 20:25:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 58 transitions. [2020-10-19 20:25:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-10-19 20:25:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-19 20:25:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2020-10-19 20:25:48,417 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-10-19 20:25:48,417 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-10-19 20:25:48,417 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:25:48,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-10-19 20:25:48,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:48,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:48,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:48,421 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:48,422 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:25:48,422 INFO L794 eck$LassoCheckResult]: Stem: 1189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1180#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1181#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1191#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1182#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1178#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1179#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1183#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1197#L535-3 assume !(main_~i~1 < main_~array_size~0); 1190#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1173#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1174#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1206#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1205#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1204#L517-3 assume !(lis_~i~0 < lis_~N); 1203#L517-4 lis_~i~0 := 1; 1200#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1195#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1186#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1187#L521-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1193#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1194#L520-3 assume !(lis_~j~0 < lis_~i~0); 1196#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1166#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1168#L520-3 [2020-10-19 20:25:48,422 INFO L796 eck$LassoCheckResult]: Loop: 1168#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1184#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1185#L521-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7; 1192#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1168#L520-3 [2020-10-19 20:25:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash 500757827, now seen corresponding path program 1 times [2020-10-19 20:25:48,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:48,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875069631] [2020-10-19 20:25:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 20:25:48,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875069631] [2020-10-19 20:25:48,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85723889] [2020-10-19 20:25:48,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-19 20:25:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:48,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 20:25:48,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 20:25:48,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:48,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-10-19 20:25:48,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281617533] [2020-10-19 20:25:48,632 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 5 times [2020-10-19 20:25:48,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:48,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330925300] [2020-10-19 20:25:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:48,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:48,644 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:48,646 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:48,762 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-19 20:25:48,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:48,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-19 20:25:48,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-19 20:25:48,819 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. cyclomatic complexity: 19 Second operand 12 states. [2020-10-19 20:25:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:49,023 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2020-10-19 20:25:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 20:25:49,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 93 transitions. [2020-10-19 20:25:49,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-19 20:25:49,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 93 transitions. [2020-10-19 20:25:49,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-19 20:25:49,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-10-19 20:25:49,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2020-10-19 20:25:49,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:49,028 INFO L691 BuchiCegarLoop]: Abstraction has 72 states and 93 transitions. [2020-10-19 20:25:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2020-10-19 20:25:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2020-10-19 20:25:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-19 20:25:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2020-10-19 20:25:49,032 INFO L714 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-10-19 20:25:49,033 INFO L594 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-10-19 20:25:49,033 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:25:49,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 87 transitions. [2020-10-19 20:25:49,034 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:49,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:49,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:49,035 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:49,035 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:49,035 INFO L794 eck$LassoCheckResult]: Stem: 1400#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1390#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1391#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1401#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1392#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1393#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1430#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1429#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1428#L535-3 assume !(main_~i~1 < main_~array_size~0); 1427#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1426#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1425#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1424#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1423#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1422#L517-3 assume !(lis_~i~0 < lis_~N); 1419#L517-4 lis_~i~0 := 1; 1417#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1415#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1413#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1411#L521-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem8;havoc lis_#t~short11;havoc lis_#t~mem7;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1409#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1408#L520-3 assume !(lis_~j~0 < lis_~i~0); 1405#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1406#L519-3 assume !(lis_~i~0 < lis_~N); 1376#L519-4 lis_~i~0 := 0; 1381#L523-3 [2020-10-19 20:25:49,035 INFO L796 eck$LassoCheckResult]: Loop: 1381#L523-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1384#L524 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1385#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1381#L523-3 [2020-10-19 20:25:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2020-10-19 20:25:49,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:49,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681059429] [2020-10-19 20:25:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,087 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:49,087 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2020-10-19 20:25:49,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:49,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162733798] [2020-10-19 20:25:49,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,095 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2020-10-19 20:25:49,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:49,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146460608] [2020-10-19 20:25:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,155 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,162 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:54,919 WARN L193 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 276 DAG size of output: 192 [2020-10-19 20:25:57,221 WARN L193 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 148 [2020-10-19 20:25:57,224 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:57,224 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:57,224 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:57,224 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:57,224 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:57,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:57,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:57,225 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:57,225 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration10_Lasso [2020-10-19 20:25:57,225 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:57,225 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:57,232 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-19 20:25:57,239 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-19 20:25:57,242 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-19 20:25:57,244 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-19 20:25:57,247 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-19 20:25:57,250 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-19 20:25:57,253 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-19 20:25:57,256 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-19 20:25:57,262 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-19 20:25:57,264 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-19 20:25:57,267 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-19 20:25:57,277 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-19 20:25:57,279 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-19 20:25:57,282 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-19 20:25:57,285 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-19 20:25:57,287 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-19 20:25:57,289 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-19 20:25:57,292 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-19 20:25:57,299 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-19 20:25:57,301 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-19 20:25:57,305 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-19 20:25:57,308 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-19 20:25:57,311 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-19 20:25:57,315 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-19 20:25:58,786 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-19 20:25:58,790 INFO L168 Benchmark]: Toolchain (without parser) took 21546.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 960.0 MB in the beginning and 983.2 MB in the end (delta: -23.3 MB). Peak memory consumption was 288.2 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:58,790 INFO L168 Benchmark]: CDTParser took 0.65 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:25:58,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 584.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:58,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:58,792 INFO L168 Benchmark]: Boogie Preprocessor took 70.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:25:58,793 INFO L168 Benchmark]: RCFGBuilder took 560.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:58,793 INFO L168 Benchmark]: BuchiAutomizer took 20223.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 983.2 MB in the end (delta: 87.5 MB). Peak memory consumption was 276.3 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:58,797 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.65 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 584.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 560.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20223.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 983.2 MB in the end (delta: 87.5 MB). Peak memory consumption was 276.3 MB. Max. memory is 11.5 GB. * 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...