./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i -s /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2aaf551f63785020042d5272893266519060a07e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:02:15,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:02:15,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:02:15,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:02:15,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:02:15,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:02:15,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:02:15,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:02:15,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:02:15,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:02:15,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:02:15,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:02:15,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:02:15,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:02:15,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:02:15,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:02:15,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:02:15,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:02:15,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:02:15,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:02:15,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:02:15,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:02:15,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:02:15,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:02:15,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:02:15,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:02:15,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:02:15,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:02:15,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:02:15,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:02:15,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:02:15,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:02:15,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:02:15,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:02:15,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:02:15,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:02:15,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:02:15,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:02:15,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:02:15,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:02:15,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:02:15,942 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-12-07 18:02:15,955 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:02:15,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:02:15,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:02:15,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:02:15,956 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:02:15,957 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 18:02:15,957 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 18:02:15,957 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 18:02:15,957 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 18:02:15,957 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 18:02:15,957 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 18:02:15,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:02:15,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:02:15,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:02:15,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:02:15,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 18:02:15,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 18:02:15,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 18:02:15,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:02:15,959 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 18:02:15,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:02:15,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 18:02:15,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:02:15,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:02:15,959 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 18:02:15,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:02:15,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:02:15,960 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:02:15,960 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 18:02:15,960 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 18:02:15,960 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aaf551f63785020042d5272893266519060a07e [2019-12-07 18:02:16,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:02:16,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:02:16,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:02:16,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:02:16,076 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:02:16,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2019-12-07 18:02:16,120 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/data/119a721cd/a338bfd7f0dc4c3a8a1b7a7c56583bc4/FLAG638016141 [2019-12-07 18:02:16,528 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:02:16,529 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2019-12-07 18:02:16,532 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/data/119a721cd/a338bfd7f0dc4c3a8a1b7a7c56583bc4/FLAG638016141 [2019-12-07 18:02:16,541 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/data/119a721cd/a338bfd7f0dc4c3a8a1b7a7c56583bc4 [2019-12-07 18:02:16,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:02:16,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:02:16,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:02:16,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:02:16,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:02:16,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d92179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16, skipping insertion in model container [2019-12-07 18:02:16,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:02:16,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:02:16,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:02:16,668 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:02:16,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:02:16,726 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:02:16,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16 WrapperNode [2019-12-07 18:02:16,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:02:16,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:02:16,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:02:16,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:02:16,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:02:16,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:02:16,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:02:16,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:02:16,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... [2019-12-07 18:02:16,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:02:16,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:02:16,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:02:16,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:02:16,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:16,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:02:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-12-07 18:02:16,805 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-12-07 18:02:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:02:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:02:16,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:02:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:02:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:02:16,940 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:02:16,940 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 18:02:16,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:02:16 BoogieIcfgContainer [2019-12-07 18:02:16,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:02:16,941 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 18:02:16,941 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 18:02:16,943 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 18:02:16,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:02:16,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 06:02:16" (1/3) ... [2019-12-07 18:02:16,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3008490b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:02:16, skipping insertion in model container [2019-12-07 18:02:16,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:02:16,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:16" (2/3) ... [2019-12-07 18:02:16,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3008490b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:02:16, skipping insertion in model container [2019-12-07 18:02:16,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:02:16,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:02:16" (3/3) ... [2019-12-07 18:02:16,946 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex9.i [2019-12-07 18:02:16,975 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 18:02:16,975 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 18:02:16,975 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 18:02:16,975 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:02:16,975 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:02:16,975 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 18:02:16,975 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:02:16,975 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 18:02:16,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-12-07 18:02:17,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:02:17,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:02:17,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:02:17,005 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:02:17,005 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:17,005 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 18:02:17,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-12-07 18:02:17,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:02:17,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:02:17,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:02:17,007 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:02:17,007 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:17,012 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 3#L29-3true [2019-12-07 18:02:17,012 INFO L796 eck$LassoCheckResult]: Loop: 3#L29-3true call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 6#L29-1true assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 13#L33true call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 5#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 9#L9true assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 16#recFINALtrue assume true; 14#recEXITtrue >#33#return; 12#L33-1true havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 3#L29-3true [2019-12-07 18:02:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-12-07 18:02:17,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:17,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639360459] [2019-12-07 18:02:17,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:17,117 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2019-12-07 18:02:17,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:17,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660085483] [2019-12-07 18:02:17,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:02:17,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660085483] [2019-12-07 18:02:17,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:17,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:02:17,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732482852] [2019-12-07 18:02:17,271 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:02:17,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:02:17,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:02:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:02:17,283 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 7 states. [2019-12-07 18:02:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:17,369 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-12-07 18:02:17,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:02:17,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-12-07 18:02:17,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:02:17,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2019-12-07 18:02:17,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-12-07 18:02:17,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-12-07 18:02:17,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-12-07 18:02:17,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:02:17,380 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-12-07 18:02:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-12-07 18:02:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 18:02:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 18:02:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-12-07 18:02:17,400 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-12-07 18:02:17,400 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-12-07 18:02:17,400 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 18:02:17,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-12-07 18:02:17,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:02:17,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:02:17,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:02:17,401 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:02:17,401 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:17,401 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 55#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 56#L29-3 [2019-12-07 18:02:17,402 INFO L796 eck$LassoCheckResult]: Loop: 56#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 61#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 59#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 64#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 57#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 58#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 64#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 57#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 60#recFINAL assume true; 67#recEXIT >#31#return; 62#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 63#recFINAL assume true; 68#recEXIT >#33#return; 66#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 56#L29-3 [2019-12-07 18:02:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-12-07 18:02:17,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:17,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764561070] [2019-12-07 18:02:17,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:17,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:17,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:17,420 INFO L82 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2019-12-07 18:02:17,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:17,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879681119] [2019-12-07 18:02:17,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:17,466 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:17,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1849555021, now seen corresponding path program 1 times [2019-12-07 18:02:17,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:17,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242067709] [2019-12-07 18:02:17,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:02:17,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242067709] [2019-12-07 18:02:17,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637132385] [2019-12-07 18:02:17,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:02:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:17,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 18:02:17,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:17,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 18:02:17,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:17,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:17,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:17,634 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-12-07 18:02:17,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:17,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 18:02:17,661 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:17,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:17,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:17,666 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:111, output treesize:3 [2019-12-07 18:02:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:02:17,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:02:17,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-12-07 18:02:17,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513057647] [2019-12-07 18:02:17,914 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-12-07 18:02:18,366 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-12-07 18:02:18,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:02:18,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:02:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:02:18,434 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-12-07 18:02:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:18,515 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-12-07 18:02:18,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:02:18,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-12-07 18:02:18,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:02:18,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-12-07 18:02:18,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-12-07 18:02:18,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-12-07 18:02:18,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-12-07 18:02:18,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:02:18,518 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-12-07 18:02:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-12-07 18:02:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 18:02:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 18:02:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-12-07 18:02:18,521 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-12-07 18:02:18,521 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-12-07 18:02:18,521 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 18:02:18,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-12-07 18:02:18,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:02:18,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:02:18,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:02:18,522 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:02:18,522 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:18,523 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 168#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 169#L29-3 [2019-12-07 18:02:18,523 INFO L796 eck$LassoCheckResult]: Loop: 169#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 176#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 171#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 177#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 170#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 172#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 177#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 170#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 172#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 177#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 170#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 173#recFINAL assume true; 180#recEXIT >#31#return; 174#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 175#recFINAL assume true; 184#recEXIT >#31#return; 182#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 183#recFINAL assume true; 181#recEXIT >#33#return; 178#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 169#L29-3 [2019-12-07 18:02:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:18,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2019-12-07 18:02:18,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:18,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105143878] [2019-12-07 18:02:18,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:18,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:18,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:18,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2019-12-07 18:02:18,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:18,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064382615] [2019-12-07 18:02:18,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:18,580 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:18,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:18,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1421169023, now seen corresponding path program 2 times [2019-12-07 18:02:18,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:18,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370117441] [2019-12-07 18:02:18,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:18,616 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:19,000 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 18:02:19,480 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 107 [2019-12-07 18:02:19,714 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:02:19,715 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:02:19,715 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:02:19,715 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:02:19,715 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:02:19,715 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:19,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:02:19,715 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:02:19,715 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration3_Lasso [2019-12-07 18:02:19,715 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:02:19,716 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:02:19,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:19,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:20,354 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:02:20,357 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:20,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:20,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:20,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:20,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:20,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:20,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:20,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:20,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:20,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:20,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:20,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:20,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:20,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:20,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:20,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:20,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:20,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:20,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:20,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:20,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:20,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:20,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:20,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:20,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:20,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:20,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:20,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:20,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:20,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:20,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:20,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:20,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:20,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:02:20,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:02:20,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:20,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:20,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:20,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:20,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:20,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:20,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:02:20,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:02:20,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:20,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:20,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:20,408 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-12-07 18:02:20,408 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2019-12-07 18:02:20,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:20,448 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2019-12-07 18:02:20,448 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-12-07 18:02:20,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:20,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:20,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:20,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:20,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:20,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:20,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:02:20,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:02:20,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:20,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:20,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:20,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:20,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:20,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:20,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:02:20,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:02:20,561 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:02:20,569 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-12-07 18:02:20,569 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:20,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:02:20,579 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 18:02:20,579 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:02:20,579 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-12-07 18:02:20,611 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-12-07 18:02:20,615 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 18:02:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:20,631 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:02:20,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:20,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 18:02:20,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:20,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:20,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 47 [2019-12-07 18:02:20,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:20,703 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:20,732 INFO L614 ElimStorePlain]: treesize reduction 16, result has 76.8 percent of original size [2019-12-07 18:02:20,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:20,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:127, output treesize:53 [2019-12-07 18:02:20,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:21,021 INFO L430 ElimStorePlain]: Different costs {4=[v_prenex_5], 7=[|v_#valid_BEFORE_CALL_4|]} [2019-12-07 18:02:21,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-12-07 18:02:21,036 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:21,078 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 65 [2019-12-07 18:02:21,103 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:21,144 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 52 [2019-12-07 18:02:21,165 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:21,233 INFO L614 ElimStorePlain]: treesize reduction 16, result has 88.2 percent of original size [2019-12-07 18:02:21,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-12-07 18:02:21,238 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:21,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 18:02:21,267 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:133, output treesize:90 [2019-12-07 18:02:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:02:21,321 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2019-12-07 18:02:21,321 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 14 states. [2019-12-07 18:02:21,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 14 states. Result 65 states and 74 transitions. Complement of second has 29 states. [2019-12-07 18:02:21,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-12-07 18:02:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 18:02:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-12-07 18:02:21,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 16 transitions. Stem has 2 letters. Loop has 20 letters. [2019-12-07 18:02:21,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:02:21,516 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:02:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:21,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:02:21,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:21,555 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 18:02:21,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:21,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 47 [2019-12-07 18:02:21,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:21,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:21,607 INFO L614 ElimStorePlain]: treesize reduction 16, result has 76.8 percent of original size [2019-12-07 18:02:21,607 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:21,607 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:127, output treesize:53 [2019-12-07 18:02:21,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:21,834 INFO L430 ElimStorePlain]: Different costs {4=[v_prenex_16], 7=[|v_#valid_BEFORE_CALL_8|]} [2019-12-07 18:02:21,849 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-12-07 18:02:21,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:21,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 65 [2019-12-07 18:02:21,910 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:21,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-12-07 18:02:21,952 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:21,985 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:21,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 52 [2019-12-07 18:02:21,995 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:22,057 INFO L614 ElimStorePlain]: treesize reduction 16, result has 87.9 percent of original size [2019-12-07 18:02:22,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 18:02:22,059 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:133, output treesize:94 [2019-12-07 18:02:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:02:22,114 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2019-12-07 18:02:22,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 14 states. [2019-12-07 18:02:23,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 14 states. Result 69 states and 79 transitions. Complement of second has 33 states. [2019-12-07 18:02:23,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2019-12-07 18:02:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 18:02:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2019-12-07 18:02:23,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. Stem has 2 letters. Loop has 20 letters. [2019-12-07 18:02:23,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:02:23,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. Stem has 22 letters. Loop has 20 letters. [2019-12-07 18:02:23,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:02:23,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. Stem has 2 letters. Loop has 40 letters. [2019-12-07 18:02:23,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:02:23,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 79 transitions. [2019-12-07 18:02:23,747 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 18:02:23,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 62 transitions. [2019-12-07 18:02:23,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-12-07 18:02:23,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-12-07 18:02:23,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 62 transitions. [2019-12-07 18:02:23,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:02:23,749 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-12-07 18:02:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 62 transitions. [2019-12-07 18:02:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 18:02:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 18:02:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-12-07 18:02:23,754 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-12-07 18:02:23,754 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-12-07 18:02:23,754 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 18:02:23,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 62 transitions. [2019-12-07 18:02:23,755 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 18:02:23,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:02:23,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:02:23,755 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:23,755 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:02:23,755 INFO L794 eck$LassoCheckResult]: Stem: 641#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 622#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 623#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 634#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 636#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 635#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 637#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 625#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 648#recENTRY [2019-12-07 18:02:23,756 INFO L796 eck$LassoCheckResult]: Loop: 648#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 662#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 626#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 648#recENTRY [2019-12-07 18:02:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:23,756 INFO L82 PathProgramCache]: Analyzing trace with hash -15910302, now seen corresponding path program 1 times [2019-12-07 18:02:23,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:23,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349240490] [2019-12-07 18:02:23,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:23,779 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 1 times [2019-12-07 18:02:23,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:23,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543003609] [2019-12-07 18:02:23,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:23,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:23,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:23,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1537404168, now seen corresponding path program 2 times [2019-12-07 18:02:23,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:23,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602780234] [2019-12-07 18:02:23,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:23,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:24,278 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2019-12-07 18:02:24,701 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 109 [2019-12-07 18:02:24,791 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:02:24,791 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:02:24,792 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:02:24,792 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:02:24,792 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:02:24,792 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:24,792 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:02:24,792 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:02:24,792 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration4_Lasso [2019-12-07 18:02:24,792 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:02:24,792 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:02:24,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:24,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:02:25,113 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2019-12-07 18:02:25,130 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:02:25,130 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:25,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:25,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:02:25,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:02:25,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:25,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:25,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:25,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:25,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:02:25,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:02:25,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:25,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:02:25,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:02:25,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:02:25,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:02:25,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:02:25,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:02:25,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:02:25,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:02:25,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:02:25,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:02:25,304 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:02:25,306 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 18:02:25,307 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:02:25,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:02:25,309 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:02:25,309 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:02:25,309 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_#in~i) = 2*rec_#in~i + 1 Supporting invariants [] [2019-12-07 18:02:25,312 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-12-07 18:02:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:25,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:02:25,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:25,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:02:25,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:02:25,359 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 [2019-12-07 18:02:25,359 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-12-07 18:02:25,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 98 states and 123 transitions. Complement of second has 13 states. [2019-12-07 18:02:25,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 18:02:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 18:02:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-12-07 18:02:25,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-12-07 18:02:25,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:02:25,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2019-12-07 18:02:25,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:02:25,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 6 letters. [2019-12-07 18:02:25,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:02:25,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 123 transitions. [2019-12-07 18:02:25,401 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 18:02:25,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 78 states and 100 transitions. [2019-12-07 18:02:25,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-12-07 18:02:25,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-12-07 18:02:25,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 100 transitions. [2019-12-07 18:02:25,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:02:25,405 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-12-07 18:02:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 100 transitions. [2019-12-07 18:02:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 18:02:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 18:02:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-12-07 18:02:25,414 INFO L711 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-12-07 18:02:25,414 INFO L591 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-12-07 18:02:25,415 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 18:02:25,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 100 transitions. [2019-12-07 18:02:25,416 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 18:02:25,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:02:25,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:02:25,417 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:02:25,417 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:02:25,418 INFO L794 eck$LassoCheckResult]: Stem: 863#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 840#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 841#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 852#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 864#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 865#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 905#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 838#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 904#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 837#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 839#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 858#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 859#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 906#recFINAL assume true; 911#recEXIT >#31#return; 848#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 851#recFINAL assume true; 903#recEXIT >#31#return; 881#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 880#recFINAL assume true; 876#recEXIT >#33#return; 862#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 854#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 856#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 874#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 899#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 897#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 845#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 889#recENTRY [2019-12-07 18:02:25,418 INFO L796 eck$LassoCheckResult]: Loop: 889#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 893#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 846#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 889#recENTRY [2019-12-07 18:02:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash -892002912, now seen corresponding path program 3 times [2019-12-07 18:02:25,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:25,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624600671] [2019-12-07 18:02:25,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:02:25,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624600671] [2019-12-07 18:02:25,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324581981] [2019-12-07 18:02:25,704 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/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 [2019-12-07 18:02:25,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 18:02:25,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:02:25,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 18:02:25,770 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:25,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:25,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 41 [2019-12-07 18:02:25,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:25,818 INFO L614 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-12-07 18:02:25,818 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:25,819 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:23 [2019-12-07 18:02:26,910 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:26,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 18:02:26,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:26,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:26,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:26,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 62 [2019-12-07 18:02:26,935 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:26,959 INFO L614 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-12-07 18:02:26,959 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:26,959 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:42 [2019-12-07 18:02:27,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:27,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 102 [2019-12-07 18:02:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,020 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:27,062 INFO L614 ElimStorePlain]: treesize reduction 69, result has 52.1 percent of original size [2019-12-07 18:02:27,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:02:27,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:02:27,064 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:27,064 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:75 [2019-12-07 18:02:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:02:27,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:02:27,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:02:27,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:27,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 26 [2019-12-07 18:02:27,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:02:27,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:27,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 41 [2019-12-07 18:02:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,133 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:27,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-12-07 18:02:27,138 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:27,152 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:27,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 26 [2019-12-07 18:02:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:27,153 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 18:02:27,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-12-07 18:02:27,158 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:27,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 18:02:27,161 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:27,195 INFO L614 ElimStorePlain]: treesize reduction 50, result has 36.7 percent of original size [2019-12-07 18:02:27,196 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 18:02:27,196 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:267, output treesize:7 [2019-12-07 18:02:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:02:27,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:02:27,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2019-12-07 18:02:27,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134693978] [2019-12-07 18:02:27,200 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:02:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 2 times [2019-12-07 18:02:27,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:27,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54608676] [2019-12-07 18:02:27,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:27,205 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:27,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:02:27,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 18:02:27,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=624, Unknown=1, NotChecked=0, Total=702 [2019-12-07 18:02:27,327 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. cyclomatic complexity: 28 Second operand 27 states. [2019-12-07 18:02:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:28,111 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2019-12-07 18:02:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:02:28,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 76 transitions. [2019-12-07 18:02:28,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:02:28,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 41 states and 51 transitions. [2019-12-07 18:02:28,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-12-07 18:02:28,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-12-07 18:02:28,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-12-07 18:02:28,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:02:28,116 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-12-07 18:02:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-12-07 18:02:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 18:02:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 18:02:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2019-12-07 18:02:28,119 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-12-07 18:02:28,119 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-12-07 18:02:28,119 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 18:02:28,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2019-12-07 18:02:28,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:02:28,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:02:28,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:02:28,122 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:28,122 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:28,122 INFO L794 eck$LassoCheckResult]: Stem: 1152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1133#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 1134#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1167#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 1136#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 1146#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1135#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1137#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1155#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1138#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1139#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1147#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1149#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1148#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1147#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1150#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 1170#recFINAL assume true; 1169#recEXIT >#31#return; 1168#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1166#recFINAL assume true; 1165#recEXIT >#31#return; 1164#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1162#recFINAL assume true; 1160#recEXIT >#31#return; 1157#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1158#recFINAL assume true; 1156#recEXIT >#33#return; 1151#L33-1 [2019-12-07 18:02:28,122 INFO L796 eck$LassoCheckResult]: Loop: 1151#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 1144#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1145#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 1141#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 1161#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1163#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1142#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1161#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1163#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1142#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1161#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1163#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1142#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1161#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1163#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1142#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1161#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1163#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 1154#recFINAL assume true; 1153#recEXIT >#31#return; 1140#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1143#recFINAL assume true; 1173#recEXIT >#31#return; 1172#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1171#recFINAL assume true; 1159#recEXIT >#31#return; 1157#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1158#recFINAL assume true; 1156#recEXIT >#31#return; 1157#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1158#recFINAL assume true; 1156#recEXIT >#33#return; 1151#L33-1 [2019-12-07 18:02:28,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1048585469, now seen corresponding path program 1 times [2019-12-07 18:02:28,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:28,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985958556] [2019-12-07 18:02:28,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:28,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:28,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash -195458237, now seen corresponding path program 3 times [2019-12-07 18:02:28,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:28,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254531378] [2019-12-07 18:02:28,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:02:28,189 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:02:28,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:28,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2091065787, now seen corresponding path program 4 times [2019-12-07 18:02:28,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:28,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323112606] [2019-12-07 18:02:28,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 29 proven. 112 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 18:02:28,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323112606] [2019-12-07 18:02:28,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966203744] [2019-12-07 18:02:28,862 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:02:28,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:02:28,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:02:28,916 INFO L264 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 18:02:28,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:28,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 18:02:28,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:28,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:28,926 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:28,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 18:02:28,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 17 [2019-12-07 18:02:28,952 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:28,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:28,959 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:28,959 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:25 [2019-12-07 18:02:59,152 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:59,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 68 [2019-12-07 18:02:59,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,187 INFO L614 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-12-07 18:02:59,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:59,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:42 [2019-12-07 18:02:59,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:02:59,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2019-12-07 18:02:59,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:59,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 69 [2019-12-07 18:02:59,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,273 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,294 INFO L614 ElimStorePlain]: treesize reduction 138, result has 22.0 percent of original size [2019-12-07 18:02:59,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,295 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:39 [2019-12-07 18:02:59,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:59,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2019-12-07 18:02:59,343 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:59,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,346 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:132, output treesize:3 [2019-12-07 18:02:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 124 refuted. 3 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 18:02:59,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:02:59,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 37 [2019-12-07 18:02:59,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694614208] [2019-12-07 18:02:59,559 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-12-07 18:02:59,820 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-12-07 18:03:00,142 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 18:03:00,555 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-12-07 18:03:01,638 WARN L192 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 131 [2019-12-07 18:03:01,879 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-12-07 18:03:01,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:01,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 18:03:01,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1259, Unknown=17, NotChecked=0, Total=1406 [2019-12-07 18:03:01,881 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. cyclomatic complexity: 13 Second operand 38 states. [2019-12-07 18:03:14,099 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-07 18:03:15,210 WARN L192 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-07 18:04:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:08,167 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2019-12-07 18:04:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:04:08,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 74 transitions. [2019-12-07 18:04:08,169 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 18:04:08,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 71 transitions. [2019-12-07 18:04:08,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-12-07 18:04:08,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2019-12-07 18:04:08,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 71 transitions. [2019-12-07 18:04:08,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:04:08,171 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 71 transitions. [2019-12-07 18:04:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 71 transitions. [2019-12-07 18:04:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-12-07 18:04:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 18:04:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2019-12-07 18:04:08,175 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-12-07 18:04:08,175 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-12-07 18:04:08,175 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 18:04:08,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 69 transitions. [2019-12-07 18:04:08,176 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 18:04:08,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:04:08,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:04:08,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:08,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:08,178 INFO L794 eck$LassoCheckResult]: Stem: 1642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1628#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 1629#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1636#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 1633#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 1653#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1652#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1632#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1650#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1651#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1626#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1638#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1625#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1627#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1638#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1625#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1627#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1638#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1639#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 1674#recFINAL assume true; 1643#recEXIT >#31#return; 1644#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1671#recFINAL assume true; 1669#recEXIT >#31#return; 1667#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1665#recFINAL assume true; 1661#recEXIT >#31#return; 1658#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1657#recFINAL assume true; 1656#recEXIT >#31#return; 1630#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1635#recFINAL assume true; 1646#recEXIT >#33#return; 1648#L33-1 [2019-12-07 18:04:08,178 INFO L796 eck$LassoCheckResult]: Loop: 1648#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 1655#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1654#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 1634#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 1649#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1659#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1631#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1649#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1659#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1631#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1649#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1659#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1631#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1649#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1659#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1631#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1649#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1659#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 1660#recFINAL assume true; 1672#recEXIT >#31#return; 1670#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1668#recFINAL assume true; 1666#recEXIT >#31#return; 1664#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1663#recFINAL assume true; 1662#recEXIT >#31#return; 1658#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1657#recFINAL assume true; 1656#recEXIT >#31#return; 1630#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1635#recFINAL assume true; 1646#recEXIT >#33#return; 1648#L33-1 [2019-12-07 18:04:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1075606773, now seen corresponding path program 2 times [2019-12-07 18:04:08,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:08,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274547289] [2019-12-07 18:04:08,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:04:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:04:08,211 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:04:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash -195458237, now seen corresponding path program 4 times [2019-12-07 18:04:08,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:08,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917944398] [2019-12-07 18:04:08,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:04:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:04:08,239 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:04:08,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:08,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2001023031, now seen corresponding path program 5 times [2019-12-07 18:04:08,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:08,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456958057] [2019-12-07 18:04:08,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 36 proven. 140 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-12-07 18:04:08,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456958057] [2019-12-07 18:04:08,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14646550] [2019-12-07 18:04:08,787 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:04:08,858 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 18:04:08,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:04:08,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 18:04:08,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:04:08,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 18:04:08,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:08,870 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:08,870 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:04:08,870 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 18:04:08,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 17 [2019-12-07 18:04:08,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:08,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:08,881 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:04:08,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:25 [2019-12-07 18:05:07,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:07,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 68 [2019-12-07 18:05:07,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:07,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:07,986 INFO L614 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-12-07 18:05:07,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:07,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:05:07,987 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:42 [2019-12-07 18:05:07,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:08,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:08,027 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:08,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2019-12-07 18:05:08,029 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:08,044 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:08,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 69 [2019-12-07 18:05:08,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:08,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:08,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:08,046 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:08,068 INFO L614 ElimStorePlain]: treesize reduction 181, result has 17.7 percent of original size [2019-12-07 18:05:08,068 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:08,068 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:39 [2019-12-07 18:05:08,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:08,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2019-12-07 18:05:08,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:08,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:08,107 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:08,107 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:132, output treesize:3 [2019-12-07 18:05:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 35 proven. 160 refuted. 6 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 18:05:08,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:08,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 35 [2019-12-07 18:05:08,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323257104] [2019-12-07 18:05:08,566 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-12-07 18:05:08,888 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 18:05:09,318 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-12-07 18:05:10,457 WARN L192 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 131 [2019-12-07 18:05:10,659 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-12-07 18:05:10,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 18:05:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1102, Unknown=27, NotChecked=0, Total=1260 [2019-12-07 18:05:10,660 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. cyclomatic complexity: 20 Second operand 36 states. [2019-12-07 18:05:19,776 WARN L192 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2019-12-07 18:05:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:21,274 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2019-12-07 18:05:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:05:21,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 82 transitions. [2019-12-07 18:05:21,276 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 18:05:21,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 82 transitions. [2019-12-07 18:05:21,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-12-07 18:05:21,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-12-07 18:05:21,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 82 transitions. [2019-12-07 18:05:21,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:05:21,278 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 82 transitions. [2019-12-07 18:05:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 82 transitions. [2019-12-07 18:05:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-07 18:05:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 18:05:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2019-12-07 18:05:21,282 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 82 transitions. [2019-12-07 18:05:21,282 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 82 transitions. [2019-12-07 18:05:21,282 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 18:05:21,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 82 transitions. [2019-12-07 18:05:21,283 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 18:05:21,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:05:21,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:05:21,284 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:21,284 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:21,284 INFO L794 eck$LassoCheckResult]: Stem: 2178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2157#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 2158#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2190#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 2170#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 2189#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2188#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2164#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2187#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2163#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2161#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2176#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2177#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2160#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2176#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2177#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2160#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2176#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2177#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2160#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2176#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2159#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 2162#recFINAL assume true; 2212#recEXIT >#31#return; 2210#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2208#recFINAL assume true; 2206#recEXIT >#31#return; 2204#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2203#recFINAL assume true; 2201#recEXIT >#31#return; 2200#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2199#recFINAL assume true; 2197#recEXIT >#31#return; 2198#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2216#recFINAL assume true; 2215#recEXIT >#31#return; 2167#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2172#recFINAL assume true; 2185#recEXIT >#33#return; 2179#L33-1 [2019-12-07 18:05:21,284 INFO L796 eck$LassoCheckResult]: Loop: 2179#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 2180#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2181#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 2169#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 2193#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2191#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2168#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2193#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2191#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2168#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2193#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2191#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2168#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2193#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2191#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2168#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2193#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2191#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2168#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2193#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2191#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 2192#recFINAL assume true; 2182#recEXIT >#31#return; 2184#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2211#recFINAL assume true; 2209#recEXIT >#31#return; 2207#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2205#recFINAL assume true; 2202#recEXIT >#31#return; 2200#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2199#recFINAL assume true; 2197#recEXIT >#31#return; 2198#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2216#recFINAL assume true; 2215#recEXIT >#31#return; 2167#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2172#recFINAL assume true; 2185#recEXIT >#33#return; 2179#L33-1 [2019-12-07 18:05:21,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:21,285 INFO L82 PathProgramCache]: Analyzing trace with hash -168209085, now seen corresponding path program 3 times [2019-12-07 18:05:21,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:21,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185998622] [2019-12-07 18:05:21,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:21,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1347159791, now seen corresponding path program 5 times [2019-12-07 18:05:21,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:21,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61609646] [2019-12-07 18:05:21,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:21,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2025501485, now seen corresponding path program 6 times [2019-12-07 18:05:21,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:21,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628994286] [2019-12-07 18:05:21,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 53 proven. 206 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 18:05:22,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628994286] [2019-12-07 18:05:22,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316530500] [2019-12-07 18:05:22,028 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:22,139 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-07 18:05:22,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:22,141 INFO L264 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 102 conjunts are in the unsatisfiable core [2019-12-07 18:05:22,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:22,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 18:05:22,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:22,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:22,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:22,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 18:05:22,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 17 [2019-12-07 18:05:22,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:22,166 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:22,166 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:22,166 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:25 [2019-12-07 18:05:30,404 WARN L192 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 14 [2019-12-07 18:05:36,531 WARN L192 SmtUtils]: Spent 6.10 s on a formula simplification that was a NOOP. DAG size: 17 [2019-12-07 18:05:45,836 WARN L192 SmtUtils]: Spent 9.28 s on a formula simplification that was a NOOP. DAG size: 17 [2019-12-07 18:05:46,898 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 17 [2019-12-07 18:05:58,930 WARN L192 SmtUtils]: Spent 12.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-12-07 18:05:58,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:58,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 69 [2019-12-07 18:05:58,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:58,973 INFO L614 ElimStorePlain]: treesize reduction 36, result has 57.6 percent of original size [2019-12-07 18:05:58,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:58,974 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:05:58,974 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:49 [2019-12-07 18:05:58,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:59,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:59,041 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:59,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 72 [2019-12-07 18:05:59,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:59,045 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2019-12-07 18:05:59,045 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:59,096 INFO L614 ElimStorePlain]: treesize reduction 48, result has 65.2 percent of original size [2019-12-07 18:05:59,096 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 18:05:59,097 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:73 [2019-12-07 18:05:59,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:59,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:59,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2019-12-07 18:05:59,157 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:59,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:59,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2019-12-07 18:05:59,160 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:59,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:59,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 18:05:59,168 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:259, output treesize:17 [2019-12-07 18:05:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 15 proven. 275 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-07 18:05:59,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:59,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 41 [2019-12-07 18:05:59,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709577264] [2019-12-07 18:05:59,529 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-12-07 18:05:59,784 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-12-07 18:06:00,122 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 18:06:00,568 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-12-07 18:06:01,139 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2019-12-07 18:06:01,332 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 18:06:02,869 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 141 DAG size of output: 140 [2019-12-07 18:06:03,147 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 18:06:03,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 18:06:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1545, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 18:06:03,149 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. cyclomatic complexity: 26 Second operand 42 states. [2019-12-07 18:06:07,194 WARN L192 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-12-07 18:06:29,871 WARN L192 SmtUtils]: Spent 22.65 s on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-12-07 18:06:42,952 WARN L192 SmtUtils]: Spent 13.05 s on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-12-07 18:06:45,686 WARN L192 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-12-07 18:07:05,101 WARN L192 SmtUtils]: Spent 19.25 s on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-12-07 18:07:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:08,506 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-12-07 18:07:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 18:07:08,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 134 transitions. [2019-12-07 18:07:08,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:07:08,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 50 states and 63 transitions. [2019-12-07 18:07:08,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-12-07 18:07:08,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-12-07 18:07:08,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 63 transitions. [2019-12-07 18:07:08,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:07:08,510 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-12-07 18:07:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 63 transitions. [2019-12-07 18:07:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 18:07:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 18:07:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-12-07 18:07:08,513 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-12-07 18:07:08,513 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-12-07 18:07:08,513 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 18:07:08,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2019-12-07 18:07:08,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:07:08,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:07:08,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:07:08,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:07:08,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-12-07 18:07:08,515 INFO L794 eck$LassoCheckResult]: Stem: 2899#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2881#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 2882#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2889#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 2893#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 2892#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2894#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2888#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2901#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2887#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2884#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2895#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2896#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2885#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2895#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2896#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2885#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2895#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2896#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2885#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2895#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2896#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2885#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2895#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2883#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 2886#recFINAL assume true; 2900#recEXIT >#31#return; 2890#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2891#recFINAL assume true; 2928#recEXIT >#31#return; 2926#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2924#recFINAL assume true; 2921#recEXIT >#31#return; 2919#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2918#recFINAL assume true; 2916#recEXIT >#31#return; 2913#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2912#recFINAL assume true; 2910#recEXIT >#31#return; 2909#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2908#recFINAL assume true; 2907#recEXIT >#31#return; 2905#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2906#recFINAL assume true; 2902#recEXIT >#33#return; 2897#L33-1 [2019-12-07 18:07:08,515 INFO L796 eck$LassoCheckResult]: Loop: 2897#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 2898#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2917#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 2904#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 2911#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2914#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2903#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2911#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2914#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2903#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2911#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2914#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2903#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2911#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2914#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2903#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2911#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2914#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2903#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2911#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2914#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2903#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2911#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2914#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 2915#recFINAL assume true; 2930#recEXIT >#31#return; 2929#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2927#recFINAL assume true; 2925#recEXIT >#31#return; 2923#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2922#recFINAL assume true; 2920#recEXIT >#31#return; 2919#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2918#recFINAL assume true; 2916#recEXIT >#31#return; 2913#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2912#recFINAL assume true; 2910#recEXIT >#31#return; 2909#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2908#recFINAL assume true; 2907#recEXIT >#31#return; 2905#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2906#recFINAL assume true; 2902#recEXIT >#33#return; 2897#L33-1 [2019-12-07 18:07:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:08,515 INFO L82 PathProgramCache]: Analyzing trace with hash -125673035, now seen corresponding path program 4 times [2019-12-07 18:07:08,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:08,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431151953] [2019-12-07 18:07:08,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:07:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:07:08,547 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:07:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash 666530563, now seen corresponding path program 6 times [2019-12-07 18:07:08,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:08,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54778143] [2019-12-07 18:07:08,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:07:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:07:08,569 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:07:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2013784393, now seen corresponding path program 7 times [2019-12-07 18:07:08,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:08,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670307637] [2019-12-07 18:07:08,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 73 proven. 285 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-12-07 18:07:09,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670307637] [2019-12-07 18:07:09,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299856552] [2019-12-07 18:07:09,358 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:07:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-07 18:07:09,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:07:09,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 18:07:09,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:09,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:09,442 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:07:09,442 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 18:07:09,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 17 [2019-12-07 18:07:09,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:09,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:09,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:07:09,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:25 [2019-12-07 18:08:42,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:08:42,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 68 [2019-12-07 18:08:42,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:08:42,944 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:08:42,970 INFO L614 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-12-07 18:08:42,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:08:42,971 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:08:42,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:42 [2019-12-07 18:08:42,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:08:43,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:08:43,030 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:08:43,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 69 [2019-12-07 18:08:43,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:08:43,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:08:43,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:08:43,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:08:43,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2019-12-07 18:08:43,035 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:08:43,058 INFO L614 ElimStorePlain]: treesize reduction 139, result has 21.9 percent of original size [2019-12-07 18:08:43,058 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:08:43,058 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:39 [2019-12-07 18:08:43,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:08:43,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2019-12-07 18:08:43,096 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:08:43,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:08:43,100 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:08:43,100 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:132, output treesize:3 [2019-12-07 18:08:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 70 proven. 313 refuted. 24 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:08:43,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:08:43,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 41 [2019-12-07 18:08:43,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313234275] [2019-12-07 18:08:43,521 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 18:08:43,807 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-12-07 18:08:44,190 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2019-12-07 18:08:44,713 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2019-12-07 18:08:44,901 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-12-07 18:08:45,447 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2019-12-07 18:08:45,701 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-12-07 18:08:45,848 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-07 18:08:47,237 WARN L192 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 146 DAG size of output: 145 [2019-12-07 18:08:47,796 WARN L192 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 18:08:47,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:47,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 18:08:47,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1508, Unknown=47, NotChecked=0, Total=1722 [2019-12-07 18:08:47,798 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 16 Second operand 42 states. [2019-12-07 18:08:57,564 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2019-12-07 18:08:59,400 WARN L192 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-12-07 18:08:59,897 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-07 18:12:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:36,755 INFO L93 Difference]: Finished difference Result 74 states and 112 transitions. [2019-12-07 18:12:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 18:12:36,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 112 transitions. [2019-12-07 18:12:36,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:12:36,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 53 states and 67 transitions. [2019-12-07 18:12:36,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-12-07 18:12:36,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-12-07 18:12:36,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2019-12-07 18:12:36,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:12:36,760 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-12-07 18:12:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2019-12-07 18:12:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 18:12:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 18:12:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2019-12-07 18:12:36,764 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-12-07 18:12:36,764 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-12-07 18:12:36,764 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 18:12:36,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions. [2019-12-07 18:12:36,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 18:12:36,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:12:36,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:12:36,767 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:36,767 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:36,767 INFO L794 eck$LassoCheckResult]: Stem: 3713#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3701#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 3702#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 3731#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 3708#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 3707#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3709#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3700#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3716#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3699#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3696#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3710#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3711#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3697#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3710#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3711#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3697#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3710#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3711#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3697#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3710#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3711#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3697#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3710#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3711#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3697#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3710#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3695#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 3698#recFINAL assume true; 3714#recEXIT >#31#return; 3703#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3704#recFINAL assume true; 3745#recEXIT >#31#return; 3743#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3741#recFINAL assume true; 3738#recEXIT >#31#return; 3736#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3735#recFINAL assume true; 3734#recEXIT >#31#return; 3733#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3732#recFINAL assume true; 3730#recEXIT >#31#return; 3727#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3726#recFINAL assume true; 3724#recEXIT >#31#return; 3723#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3722#recFINAL assume true; 3721#recEXIT >#31#return; 3719#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3720#recFINAL assume true; 3717#recEXIT >#33#return; 3712#L33-1 [2019-12-07 18:12:36,767 INFO L796 eck$LassoCheckResult]: Loop: 3712#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 3705#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 3706#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 3715#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 3725#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3728#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3718#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3725#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3728#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3718#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3725#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3728#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3718#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3725#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3728#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3718#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3725#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3728#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3718#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3725#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3728#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3718#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3725#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3728#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3718#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3725#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3728#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 3729#recFINAL assume true; 3747#recEXIT >#31#return; 3746#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3744#recFINAL assume true; 3742#recEXIT >#31#return; 3740#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3739#recFINAL assume true; 3737#recEXIT >#31#return; 3736#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3735#recFINAL assume true; 3734#recEXIT >#31#return; 3733#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3732#recFINAL assume true; 3730#recEXIT >#31#return; 3727#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3726#recFINAL assume true; 3724#recEXIT >#31#return; 3723#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3722#recFINAL assume true; 3721#recEXIT >#31#return; 3719#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3720#recFINAL assume true; 3717#recEXIT >#33#return; 3712#L33-1 [2019-12-07 18:12:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1055359101, now seen corresponding path program 5 times [2019-12-07 18:12:36,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:36,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877754445] [2019-12-07 18:12:36,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:12:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:12:36,793 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:12:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 241557073, now seen corresponding path program 7 times [2019-12-07 18:12:36,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:36,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036453630] [2019-12-07 18:12:36,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:12:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:12:36,824 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:12:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:36,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1444562605, now seen corresponding path program 8 times [2019-12-07 18:12:36,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:36,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293998696] [2019-12-07 18:12:36,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 96 proven. 377 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 18:12:37,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293998696] [2019-12-07 18:12:37,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805354541] [2019-12-07 18:12:37,688 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_905c91a2-6534-4703-bde9-213b378c3a31/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:12:37,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:12:37,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:12:37,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 82 conjunts are in the unsatisfiable core [2019-12-07 18:12:37,775 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:12:37,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 18:12:37,780 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:37,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:37,784 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:37,784 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 18:12:37,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 17 [2019-12-07 18:12:37,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:12:37,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:12:37,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:12:37,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:25 [2019-12-07 18:14:48,728 WARN L192 SmtUtils]: Spent 3.55 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 18:14:48,746 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:14:48,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 68 [2019-12-07 18:14:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:14:48,747 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:14:48,773 INFO L614 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-12-07 18:14:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:14:48,773 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:14:48,773 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:42 [2019-12-07 18:14:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:14:48,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:14:48,838 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:14:48,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 69 [2019-12-07 18:14:48,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:14:48,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:14:48,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:14:48,840 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:14:48,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2019-12-07 18:14:48,844 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:14:48,869 INFO L614 ElimStorePlain]: treesize reduction 138, result has 22.0 percent of original size [2019-12-07 18:14:48,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:14:48,870 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:39 [2019-12-07 18:14:48,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:14:48,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2019-12-07 18:14:48,911 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:14:48,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:14:48,914 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:14:48,914 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:132, output treesize:3 [2019-12-07 18:14:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 92 proven. 430 refuted. 15 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 18:14:48,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:14:48,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 44 [2019-12-07 18:14:48,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88453641] [2019-12-07 18:14:49,145 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-12-07 18:14:49,405 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-12-07 18:14:49,739 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 18:14:50,185 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-12-07 18:14:50,346 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 18:14:50,754 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2019-12-07 18:14:50,979 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-12-07 18:14:51,082 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 18:14:51,497 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 127 [2019-12-07 18:14:51,636 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-12-07 18:14:51,806 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-12-07 18:14:51,958 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 18:14:52,631 WARN L192 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 137 [2019-12-07 18:14:52,804 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 18:14:52,989 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-12-07 18:14:53,212 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 18:14:55,309 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 160 DAG size of output: 159 [2019-12-07 18:14:55,941 WARN L192 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-12-07 18:14:55,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:14:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 18:14:55,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1733, Unknown=55, NotChecked=0, Total=1980 [2019-12-07 18:14:55,943 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. cyclomatic complexity: 17 Second operand 45 states. [2019-12-07 18:15:09,008 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2019-12-07 18:15:10,498 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-12-07 18:15:11,812 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2019-12-07 18:15:13,916 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-12-07 18:16:38,768 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-12-07 18:16:38,769 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2019-12-07 18:16:38,771 INFO L168 Benchmark]: Toolchain (without parser) took 862227.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:16:38,771 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:16:38,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:16:38,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:16:38,772 INFO L168 Benchmark]: Boogie Preprocessor took 14.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:16:38,772 INFO L168 Benchmark]: RCFGBuilder took 176.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:16:38,772 INFO L168 Benchmark]: BuchiAutomizer took 861829.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 32.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:16:38,774 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 182.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 176.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 861829.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 32.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...