./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f053c4de2291716f40c056dd251ccd74d5a7493 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:46:06,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:46:06,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:46:06,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:46:06,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:46:06,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:46:06,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:46:06,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:46:06,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:46:06,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:46:06,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:46:06,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:46:06,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:46:06,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:46:06,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:46:06,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:46:06,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:46:06,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:46:06,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:46:06,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:46:06,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:46:06,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:46:06,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:46:06,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:46:06,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:46:06,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:46:06,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:46:06,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:46:06,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:46:06,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:46:06,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:46:06,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:46:06,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:46:06,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:46:06,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:46:06,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:46:06,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:46:06,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:46:06,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:46:06,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:46:06,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:46:06,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 04:46:06,723 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:46:06,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:46:06,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:46:06,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:46:06,727 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:46:06,727 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:46:06,727 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:46:06,728 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:46:06,728 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:46:06,728 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:46:06,729 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:46:06,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:46:06,729 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:46:06,730 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:46:06,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:46:06,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:46:06,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:46:06,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:46:06,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:46:06,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:46:06,731 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:46:06,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:46:06,731 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:46:06,731 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:46:06,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:46:06,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:46:06,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:46:06,732 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:46:06,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:46:06,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:46:06,733 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:46:06,733 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:46:06,735 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:46:06,735 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f053c4de2291716f40c056dd251ccd74d5a7493 [2020-10-26 04:46:07,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:46:07,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:46:07,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:46:07,179 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:46:07,179 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:46:07,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2020-10-26 04:46:07,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cff183b6/b83d2466a1ce4be1ac2aabf39ae17b79/FLAGa08365268 [2020-10-26 04:46:08,024 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:46:08,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2020-10-26 04:46:08,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cff183b6/b83d2466a1ce4be1ac2aabf39ae17b79/FLAGa08365268 [2020-10-26 04:46:08,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cff183b6/b83d2466a1ce4be1ac2aabf39ae17b79 [2020-10-26 04:46:08,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:46:08,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:46:08,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:46:08,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:46:08,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:46:08,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bdab02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08, skipping insertion in model container [2020-10-26 04:46:08,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:46:08,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:46:08,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:46:08,720 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:46:08,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:46:08,846 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:46:08,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08 WrapperNode [2020-10-26 04:46:08,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:46:08,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:46:08,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:46:08,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:46:08,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:46:08,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:46:08,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:46:08,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:46:08,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... [2020-10-26 04:46:08,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:46:08,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:46:08,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:46:08,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:46:08,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-26 04:46:09,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-26 04:46:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:46:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-26 04:46:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:46:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-26 04:46:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:46:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:46:09,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:46:09,396 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:46:09,397 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-26 04:46:09,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:46:09 BoogieIcfgContainer [2020-10-26 04:46:09,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:46:09,400 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:46:09,400 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:46:09,409 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:46:09,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:46:09,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:46:08" (1/3) ... [2020-10-26 04:46:09,412 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@381d1594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:46:09, skipping insertion in model container [2020-10-26 04:46:09,416 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:46:09,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:08" (2/3) ... [2020-10-26 04:46:09,417 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@381d1594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:46:09, skipping insertion in model container [2020-10-26 04:46:09,417 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:46:09,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:46:09" (3/3) ... [2020-10-26 04:46:09,419 INFO L373 chiAutomizerObserver]: Analyzing ICFG test-0232_1-2.i [2020-10-26 04:46:09,497 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:46:09,497 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:46:09,497 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:46:09,497 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:46:09,497 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:46:09,498 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:46:09,498 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:46:09,498 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:46:09,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-26 04:46:09,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-26 04:46:09,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:09,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:09,543 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:46:09,543 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:46:09,543 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:46:09,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-26 04:46:09,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-26 04:46:09,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:09,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:09,548 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:46:09,548 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:46:09,560 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 4#L-1true havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 10#L543-3true [2020-10-26 04:46:09,561 INFO L796 eck$LassoCheckResult]: Loop: 10#L543-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 3#L534true assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 5#L534-2true call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 12#L529true main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 7#L543-1true assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 10#L543-3true [2020-10-26 04:46:09,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:09,570 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:46:09,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:09,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954190991] [2020-10-26 04:46:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:09,777 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:09,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:09,854 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2020-10-26 04:46:09,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:09,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970168476] [2020-10-26 04:46:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:09,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:10,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:10,019 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:10,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2020-10-26 04:46:10,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:10,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273716253] [2020-10-26 04:46:10,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:10,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273716253] [2020-10-26 04:46:10,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:10,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 04:46:10,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656445236] [2020-10-26 04:46:11,554 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2020-10-26 04:46:11,650 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:11,663 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:12,644 WARN L193 SmtUtils]: Spent 980.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-26 04:46:12,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:12,660 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:12,676 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:13,487 WARN L193 SmtUtils]: Spent 809.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-26 04:46:13,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:13,492 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-26 04:46:13,493 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:739, output treesize:723 [2020-10-26 04:46:14,272 WARN L193 SmtUtils]: Spent 775.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-26 04:46:14,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:14,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 04:46:14,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 04:46:14,293 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2020-10-26 04:46:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:14,372 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-10-26 04:46:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:46:14,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2020-10-26 04:46:14,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-26 04:46:14,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 16 transitions. [2020-10-26 04:46:14,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 04:46:14,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 04:46:14,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2020-10-26 04:46:14,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:14,388 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-10-26 04:46:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2020-10-26 04:46:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2020-10-26 04:46:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-26 04:46:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-10-26 04:46:14,424 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-26 04:46:14,424 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-26 04:46:14,424 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:46:14,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-10-26 04:46:14,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-26 04:46:14,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:14,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:14,430 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:46:14,430 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:46:14,432 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 46#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 47#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 54#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 44#L534-2 [2020-10-26 04:46:14,433 INFO L796 eck$LassoCheckResult]: Loop: 44#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 45#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 49#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 51#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 53#L534 assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 44#L534-2 [2020-10-26 04:46:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2020-10-26 04:46:14,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:14,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931514451] [2020-10-26 04:46:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:14,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:14,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:14,495 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2020-10-26 04:46:14,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:14,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303110439] [2020-10-26 04:46:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:14,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:14,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:14,532 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:14,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2020-10-26 04:46:14,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:14,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982292144] [2020-10-26 04:46:14,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:14,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:14,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:14,655 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:15,690 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 170 DAG size of output: 164 [2020-10-26 04:46:15,740 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:15,777 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:16,954 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 165 [2020-10-26 04:46:16,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:16,976 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:16,989 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:18,329 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 166 [2020-10-26 04:46:18,330 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:18,335 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-26 04:46:18,335 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:861, output treesize:905 [2020-10-26 04:46:19,761 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 166 [2020-10-26 04:46:20,679 WARN L193 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 140 [2020-10-26 04:46:20,978 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-26 04:46:20,991 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:46:20,991 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:46:20,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:46:20,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:46:20,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:46:20,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:20,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:46:20,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:46:20,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration2_Lasso [2020-10-26 04:46:20,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:46:20,993 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:46:21,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:21,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:21,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:21,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:21,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:21,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:21,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:21,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:21,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:21,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:22,176 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2020-10-26 04:46:24,322 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 139 DAG size of output: 122 [2020-10-26 04:46:24,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,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-26 04:46:24,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:24,833 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-26 04:46:25,287 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-26 04:46:27,438 WARN L193 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2020-10-26 04:46:34,145 WARN L193 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2020-10-26 04:46:34,287 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:46:34,291 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,309 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-26 04:46:34,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:34,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:34,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:34,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,402 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:34,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:34,441 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-26 04:46:34,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,533 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-26 04:46:34,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,563 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-26 04:46:34,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,593 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:34,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:34,633 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-26 04:46:34,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:34,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:34,666 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) [2020-10-26 04:46:34,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:34,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,718 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) [2020-10-26 04:46:34,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:34,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,781 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-26 04:46:34,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:34,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:34,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:34,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:34,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:34,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:34,982 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:34,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:34,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:34,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:34,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:34,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:34,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:34,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:34,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:35,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:35,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:35,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:35,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:35,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:35,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:35,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:35,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:35,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:35,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:35,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:35,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:35,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:35,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:35,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:35,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:35,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:35,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:35,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:35,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:35,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:35,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:35,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:35,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:35,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:35,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:35,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:35,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:35,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:35,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:35,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:35,160 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:35,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:35,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:35,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:35,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:35,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:35,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:35,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:35,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:35,191 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 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:35,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:35,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:35,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:35,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:35,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:35,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:35,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:35,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:35,220 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:35,244 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:35,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:35,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:35,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:35,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:35,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:35,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:35,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:35,248 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:35,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:35,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:35,276 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-10-26 04:46:35,276 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2020-10-26 04:46:35,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:36,775 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2020-10-26 04:46:36,776 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2020-10-26 04:46:39,265 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:39,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:39,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:39,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:39,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:39,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:39,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:39,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:39,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:39,309 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:39,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:39,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:39,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:39,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:39,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:39,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:39,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:39,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:39,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:39,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:39,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:39,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:39,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:39,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:39,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:39,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:39,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:39,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:39,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:39,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:39,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:39,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:39,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:39,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:39,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:39,414 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:39,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:39,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:39,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:39,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:39,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:39,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:39,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:39,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:39,441 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:39,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:39,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:39,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:39,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:39,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:39,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:39,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:39,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:39,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 34 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:39,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:39,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:39,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:39,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:39,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:39,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:39,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:39,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:39,502 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:39,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:39,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:39,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:39,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:39,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:39,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:39,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:39,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:46:39,576 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-26 04:46:39,576 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:39,581 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:39,585 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:46:39,585 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:46:39,586 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2020-10-26 04:46:39,829 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-10-26 04:46:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:39,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:46:39,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:39,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:46:39,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:39,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-26 04:46:39,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-10-26 04:46:40,034 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 19 states and 26 transitions. Complement of second has 6 states. [2020-10-26 04:46:40,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:46:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:46:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-26 04:46:40,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2020-10-26 04:46:40,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:40,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2020-10-26 04:46:40,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:40,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2020-10-26 04:46:40,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:40,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-10-26 04:46:40,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-26 04:46:40,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2020-10-26 04:46:40,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-26 04:46:40,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-26 04:46:40,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-10-26 04:46:40,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:40,045 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-26 04:46:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-10-26 04:46:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-26 04:46:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 04:46:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-26 04:46:40,047 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-26 04:46:40,047 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-26 04:46:40,047 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:46:40,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-26 04:46:40,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-26 04:46:40,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:40,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:40,049 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:46:40,049 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 04:46:40,050 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 181#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 182#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 189#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 191#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 178#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 184#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 185#L543-4 assume !(main_~length~0 > 0); 183#L554-1 [2020-10-26 04:46:40,050 INFO L796 eck$LassoCheckResult]: Loop: 183#L554-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 183#L554-1 [2020-10-26 04:46:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:40,050 INFO L82 PathProgramCache]: Analyzing trace with hash 149888852, now seen corresponding path program 1 times [2020-10-26 04:46:40,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:40,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070764723] [2020-10-26 04:46:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:40,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070764723] [2020-10-26 04:46:40,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:40,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:46:40,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698307109] [2020-10-26 04:46:40,090 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:46:40,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-10-26 04:46:40,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:40,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69108240] [2020-10-26 04:46:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:40,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:40,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:40,102 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:40,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 04:46:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 04:46:40,292 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-26 04:46:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:40,314 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-10-26 04:46:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:46:40,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2020-10-26 04:46:40,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-26 04:46:40,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2020-10-26 04:46:40,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-26 04:46:40,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-26 04:46:40,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2020-10-26 04:46:40,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:40,319 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-26 04:46:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2020-10-26 04:46:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-10-26 04:46:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 04:46:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-10-26 04:46:40,322 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-26 04:46:40,322 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-26 04:46:40,322 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:46:40,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-10-26 04:46:40,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-26 04:46:40,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:40,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:40,325 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:46:40,325 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 04:46:40,326 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 216#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 217#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 228#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 230#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 219#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 223#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 224#L543-4 assume main_~length~0 > 0;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 222#L554-1 [2020-10-26 04:46:40,326 INFO L796 eck$LassoCheckResult]: Loop: 222#L554-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 222#L554-1 [2020-10-26 04:46:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash 149888850, now seen corresponding path program 1 times [2020-10-26 04:46:40,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:40,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256545772] [2020-10-26 04:46:40,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:40,381 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:40,416 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:40,425 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:40,426 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2020-10-26 04:46:40,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:40,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480766732] [2020-10-26 04:46:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:40,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:40,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:40,452 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:40,455 INFO L82 PathProgramCache]: Analyzing trace with hash 351587092, now seen corresponding path program 1 times [2020-10-26 04:46:40,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:40,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918038266] [2020-10-26 04:46:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:40,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918038266] [2020-10-26 04:46:40,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:40,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 04:46:40,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840992395] [2020-10-26 04:46:40,631 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-10-26 04:46:40,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:40,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:46:40,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:46:40,680 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-10-26 04:46:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:40,712 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-10-26 04:46:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:46:40,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2020-10-26 04:46:40,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-26 04:46:40,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 29 transitions. [2020-10-26 04:46:40,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-26 04:46:40,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-26 04:46:40,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2020-10-26 04:46:40,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:40,720 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-10-26 04:46:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2020-10-26 04:46:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2020-10-26 04:46:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 04:46:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-10-26 04:46:40,725 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-26 04:46:40,726 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-26 04:46:40,726 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:46:40,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-10-26 04:46:40,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-26 04:46:40,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:40,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:40,730 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:46:40,730 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 04:46:40,730 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 271#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 272#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 279#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 268#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 269#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 276#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 277#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 280#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 282#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 281#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 274#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 275#L543-4 assume main_~length~0 > 0;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 273#L554-1 [2020-10-26 04:46:40,730 INFO L796 eck$LassoCheckResult]: Loop: 273#L554-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 273#L554-1 [2020-10-26 04:46:40,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:40,732 INFO L82 PathProgramCache]: Analyzing trace with hash -315524230, now seen corresponding path program 1 times [2020-10-26 04:46:40,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:40,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104067818] [2020-10-26 04:46:40,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:40,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104067818] [2020-10-26 04:46:40,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356694987] [2020-10-26 04:46:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:46:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:40,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-26 04:46:40,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:41,043 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:41,043 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2020-10-26 04:46:41,044 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:41,106 INFO L625 ElimStorePlain]: treesize reduction 20, result has 66.7 percent of original size [2020-10-26 04:46:41,131 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:41,132 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:18 [2020-10-26 04:46:41,262 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-26 04:46:41,266 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:41,266 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 11 [2020-10-26 04:46:41,267 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:41,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:41,287 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:46:41,287 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:4 [2020-10-26 04:46:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:41,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:46:41,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2020-10-26 04:46:41,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135374899] [2020-10-26 04:46:41,291 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:46:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times [2020-10-26 04:46:41,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:41,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999582770] [2020-10-26 04:46:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:41,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:41,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:41,307 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:41,412 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-10-26 04:46:41,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 04:46:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 04:46:41,465 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-10-26 04:46:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:41,585 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-10-26 04:46:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:46:41,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2020-10-26 04:46:41,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-26 04:46:41,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2020-10-26 04:46:41,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-26 04:46:41,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-26 04:46:41,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2020-10-26 04:46:41,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:41,590 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-26 04:46:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2020-10-26 04:46:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-26 04:46:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 04:46:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-10-26 04:46:41,592 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-26 04:46:41,592 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-26 04:46:41,592 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:46:41,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-10-26 04:46:41,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-26 04:46:41,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:41,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:41,596 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:46:41,596 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 04:46:41,597 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 349#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 350#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 361#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 363#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 354#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 358#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 359#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 362#L534 assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 351#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 352#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 356#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 357#L543-4 assume main_~length~0 > 0;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 355#L554-1 [2020-10-26 04:46:41,597 INFO L796 eck$LassoCheckResult]: Loop: 355#L554-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 355#L554-1 [2020-10-26 04:46:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:41,598 INFO L82 PathProgramCache]: Analyzing trace with hash -317371272, now seen corresponding path program 1 times [2020-10-26 04:46:41,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:41,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154251599] [2020-10-26 04:46:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:41,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:41,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:41,740 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 4 times [2020-10-26 04:46:41,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:41,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469341993] [2020-10-26 04:46:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:41,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:41,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:41,755 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:41,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1248574802, now seen corresponding path program 1 times [2020-10-26 04:46:41,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:41,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513862184] [2020-10-26 04:46:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:41,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:41,872 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:41,879 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:09,781 WARN L193 SmtUtils]: Spent 27.76 s on a formula simplification. DAG size of input: 400 DAG size of output: 324 [2020-10-26 04:47:10,146 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:47:14,915 WARN L193 SmtUtils]: Spent 4.77 s on a formula simplification that was a NOOP. DAG size: 227 [2020-10-26 04:47:14,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:47:14,960 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:47:19,229 WARN L193 SmtUtils]: Spent 4.27 s on a formula simplification that was a NOOP. DAG size: 223 [2020-10-26 04:47:19,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:47:19,263 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:47:23,426 WARN L193 SmtUtils]: Spent 4.16 s on a formula simplification that was a NOOP. DAG size: 220 [2020-10-26 04:47:23,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:47:23,461 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:47:26,972 WARN L193 SmtUtils]: Spent 3.51 s on a formula simplification that was a NOOP. DAG size: 217 [2020-10-26 04:47:26,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:47:26,998 INFO L545 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:47:30,181 WARN L193 SmtUtils]: Spent 3.18 s on a formula simplification that was a NOOP. DAG size: 213 [2020-10-26 04:47:30,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:47:30,216 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:47:33,295 WARN L193 SmtUtils]: Spent 3.08 s on a formula simplification that was a NOOP. DAG size: 210 [2020-10-26 04:47:33,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:47:33,349 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2020-10-26 04:47:33,350 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:12084, output treesize:12326 [2020-10-26 04:47:36,619 WARN L193 SmtUtils]: Spent 3.23 s on a formula simplification that was a NOOP. DAG size: 210 [2020-10-26 04:47:36,623 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:47:36,623 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:47:36,623 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:47:36,624 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:47:36,624 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:47:36,624 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:36,624 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:47:36,624 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:47:36,624 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration6_Lasso [2020-10-26 04:47:36,624 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:47:36,624 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:47:36,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,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-26 04:47:36,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:36,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:38,233 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-10-26 04:47:38,239 INFO L168 Benchmark]: Toolchain (without parser) took 89983.49 ms. Allocated memory was 41.9 MB in the beginning and 352.3 MB in the end (delta: 310.4 MB). Free memory was 17.3 MB in the beginning and 275.6 MB in the end (delta: -258.3 MB). Peak memory consumption was 215.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:38,239 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 19.9 MB in the end (delta: 42.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:47:38,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.14 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 16.7 MB in the beginning and 26.6 MB in the end (delta: -9.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:38,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.96 ms. Allocated memory is still 50.3 MB. Free memory was 26.6 MB in the beginning and 24.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:38,245 INFO L168 Benchmark]: Boogie Preprocessor took 31.55 ms. Allocated memory is still 50.3 MB. Free memory was 24.7 MB in the beginning and 23.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:47:38,247 INFO L168 Benchmark]: RCFGBuilder took 468.56 ms. Allocated memory is still 50.3 MB. Free memory was 23.2 MB in the beginning and 30.9 MB in the end (delta: -7.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:38,248 INFO L168 Benchmark]: BuchiAutomizer took 88837.91 ms. Allocated memory was 50.3 MB in the beginning and 352.3 MB in the end (delta: 302.0 MB). Free memory was 30.8 MB in the beginning and 275.6 MB in the end (delta: -244.8 MB). Peak memory consumption was 219.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:38,253 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.19 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 19.9 MB in the end (delta: 42.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 583.14 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 16.7 MB in the beginning and 26.6 MB in the end (delta: -9.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.96 ms. Allocated memory is still 50.3 MB. Free memory was 26.6 MB in the beginning and 24.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.55 ms. Allocated memory is still 50.3 MB. Free memory was 24.7 MB in the beginning and 23.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 468.56 ms. Allocated memory is still 50.3 MB. Free memory was 23.2 MB in the beginning and 30.9 MB in the end (delta: -7.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 88837.91 ms. Allocated memory was 50.3 MB in the beginning and 352.3 MB in the end (delta: 302.0 MB). Free memory was 30.8 MB in the beginning and 275.6 MB in the end (delta: -244.8 MB). Peak memory consumption was 219.6 MB. Max. memory is 16.1 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...