./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/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 32bit --witnessprinter.graph.data.programhash 0db1674e58e1126b93b48759a00b2e69f0d5f058 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:36:43,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:36:43,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:36:43,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:36:43,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:36:43,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:36:43,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:36:43,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:36:43,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:36:43,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:36:43,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:36:43,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:36:43,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:36:43,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:36:43,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:36:43,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:36:43,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:36:43,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:36:43,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:36:43,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:36:43,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:36:43,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:36:43,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:36:43,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:36:43,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:36:43,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:36:43,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:36:43,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:36:43,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:36:43,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:36:43,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:36:43,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:36:43,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:36:43,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:36:43,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:36:43,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:36:43,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:36:43,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:36:43,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:36:43,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:36:43,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:36:43,842 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:36:43,874 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:36:43,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:36:43,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:36:43,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:36:43,875 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:36:43,875 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:36:43,875 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:36:43,875 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:36:43,876 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:36:43,876 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:36:43,876 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:36:43,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:36:43,876 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:36:43,876 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:36:43,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:36:43,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:36:43,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:36:43,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:36:43,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:36:43,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:36:43,877 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:36:43,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:36:43,878 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:36:43,878 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:36:43,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:36:43,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:36:43,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:36:43,879 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:36:43,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:36:43,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:36:43,879 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:36:43,880 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:36:43,881 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_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0db1674e58e1126b93b48759a00b2e69f0d5f058 [2019-11-15 22:36:43,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:36:43,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:36:43,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:36:43,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:36:43,920 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:36:43,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-11-15 22:36:43,968 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/data/5bcc20454/733eb909a0314c4e9c6a5a40d9025ab0/FLAG3cd4b06ef [2019-11-15 22:36:44,479 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:36:44,479 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-11-15 22:36:44,503 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/data/5bcc20454/733eb909a0314c4e9c6a5a40d9025ab0/FLAG3cd4b06ef [2019-11-15 22:36:44,941 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/bin/uautomizer/data/5bcc20454/733eb909a0314c4e9c6a5a40d9025ab0 [2019-11-15 22:36:44,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:36:44,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:36:44,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:36:44,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:36:44,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:36:44,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:36:44" (1/1) ... [2019-11-15 22:36:44,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bf6310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:44, skipping insertion in model container [2019-11-15 22:36:44,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:36:44" (1/1) ... [2019-11-15 22:36:44,959 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:36:44,992 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:36:45,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:36:45,353 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:36:45,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:36:45,444 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:36:45,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45 WrapperNode [2019-11-15 22:36:45,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:36:45,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:36:45,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:36:45,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:36:45,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... [2019-11-15 22:36:45,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... [2019-11-15 22:36:45,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:36:45,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:36:45,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:36:45,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:36:45,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... [2019-11-15 22:36:45,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... [2019-11-15 22:36:45,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... [2019-11-15 22:36:45,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... [2019-11-15 22:36:45,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... [2019-11-15 22:36:45,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... [2019-11-15 22:36:45,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... [2019-11-15 22:36:45,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:36:45,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:36:45,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:36:45,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:36:45,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/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-11-15 22:36:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:36:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:36:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:36:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:36:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:36:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 22:36:45,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:36:45,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:36:45,977 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:36:45,977 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:36:45,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:36:45 BoogieIcfgContainer [2019-11-15 22:36:45,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:36:45,979 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:36:45,979 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:36:45,982 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:36:45,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:36:45,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:36:44" (1/3) ... [2019-11-15 22:36:45,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cc8e0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:36:45, skipping insertion in model container [2019-11-15 22:36:45,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:36:45,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:45" (2/3) ... [2019-11-15 22:36:45,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cc8e0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:36:45, skipping insertion in model container [2019-11-15 22:36:45,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:36:45,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:36:45" (3/3) ... [2019-11-15 22:36:45,986 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2019-11-15 22:36:46,037 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:36:46,037 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:36:46,037 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:36:46,037 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:36:46,037 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:36:46,038 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:36:46,038 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:36:46,038 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:36:46,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 22:36:46,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:36:46,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:36:46,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:36:46,076 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:36:46,076 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:36:46,076 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:36:46,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 22:36:46,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:36:46,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:36:46,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:36:46,078 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:36:46,078 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:36:46,085 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 8#L-1true havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 14#L532-3true [2019-11-15 22:36:46,085 INFO L793 eck$LassoCheckResult]: Loop: 14#L532-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 5#L523true assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 9#L523-2true call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 15#L518true main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 11#L532-1true assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 14#L532-3true [2019-11-15 22:36:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 22:36:46,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:46,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505642778] [2019-11-15 22:36:46,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:46,206 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:36:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2019-11-15 22:36:46,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:46,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60072280] [2019-11-15 22:36:46,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:46,270 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:36:46,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:46,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2019-11-15 22:36:46,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:46,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825330430] [2019-11-15 22:36:46,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:46,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825330430] [2019-11-15 22:36:46,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:46,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:46,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350933747] [2019-11-15 22:36:47,371 WARN L191 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 125 [2019-11-15 22:36:48,198 WARN L191 SmtUtils]: Spent 813.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 22:36:48,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:48,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:48,216 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-11-15 22:36:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:48,298 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-15 22:36:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:36:48,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-15 22:36:48,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:36:48,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2019-11-15 22:36:48,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 22:36:48,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 22:36:48,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-15 22:36:48,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:36:48,309 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 22:36:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-15 22:36:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-11-15 22:36:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:36:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 22:36:48,339 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:36:48,339 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:36:48,339 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:36:48,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 22:36:48,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:36:48,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:36:48,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:36:48,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:36:48,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:36:48,344 INFO L791 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 48#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 49#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 60#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 50#L523-2 [2019-11-15 22:36:48,344 INFO L793 eck$LassoCheckResult]: Loop: 50#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 51#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 54#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 56#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 59#L523 assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 50#L523-2 [2019-11-15 22:36:48,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:48,345 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2019-11-15 22:36:48,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:48,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312672573] [2019-11-15 22:36:48,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:48,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:48,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:48,437 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:36:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:48,440 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2019-11-15 22:36:48,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:48,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445477921] [2019-11-15 22:36:48,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:48,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:48,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:48,517 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:36:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2019-11-15 22:36:48,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:48,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706730704] [2019-11-15 22:36:48,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:48,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:48,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:36:48,664 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:36:49,374 WARN L191 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2019-11-15 22:36:50,422 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 139 [2019-11-15 22:36:50,765 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 111 [2019-11-15 22:36:50,880 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 22:36:50,900 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:36:50,900 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:36:50,901 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:36:50,901 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:36:50,901 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:36:50,901 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:36:50,901 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:36:50,902 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:36:50,902 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2019-11-15 22:36:50,902 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:36:50,902 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:36:50,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:50,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:51,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:51,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:51,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:51,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:51,464 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-15 22:36:52,768 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-11-15 22:36:52,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:52,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:52,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-11-15 22:36:52,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-11-15 22:36:52,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-11-15 22:36:52,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-11-15 22:36:52,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-11-15 22:36:52,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-11-15 22:36:52,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-11-15 22:36:52,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-11-15 22:36:52,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:52,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-11-15 22:36:52,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-11-15 22:36:52,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-11-15 22:36:52,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:52,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:52,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:52,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:36:53,059 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-15 22:36:53,318 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-15 22:36:54,862 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-11-15 22:36:59,383 WARN L191 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2019-11-15 22:36:59,511 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:36:59,515 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:36:59,517 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-11-15 22:36:59,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,524 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:36:59,524 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:36:59,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,534 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-11-15 22:36:59,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,535 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,536 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,537 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-11-15 22:36:59,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,538 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,539 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,539 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,540 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-11-15 22:36:59,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,542 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,542 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,543 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-11-15 22:36:59,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,544 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,546 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:36:59,546 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:36:59,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,548 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-11-15 22:36:59,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,550 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,551 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-11-15 22:36:59,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,552 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,553 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,553 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,554 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-11-15 22:36:59,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,556 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,556 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,557 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-11-15 22:36:59,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,558 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,559 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,559 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,560 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-11-15 22:36:59,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,562 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,562 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,563 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-11-15 22:36:59,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,565 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,565 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,566 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-11-15 22:36:59,566 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,567 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,567 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,567 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,567 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,568 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,568 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,569 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-11-15 22:36:59,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,569 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,572 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-11-15 22:36:59,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,574 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-11-15 22:36:59,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,577 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:36:59,577 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:36:59,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,579 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-11-15 22:36:59,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,580 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:36:59,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,582 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-11-15 22:36:59,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,583 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:36:59,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,583 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:36:59,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,584 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 22:36:59,584 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:36:59,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,587 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-11-15 22:36:59,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,587 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,589 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:36:59,589 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:36:59,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,593 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-11-15 22:36:59,594 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,594 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:36:59,594 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:36:59,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:36:59,596 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:36:59,596 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:36:59,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:36:59,600 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-11-15 22:36:59,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:36:59,601 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-11-15 22:36:59,601 INFO L203 nArgumentSynthesizer]: 8 loop disjuncts [2019-11-15 22:36:59,601 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:00,224 INFO L400 nArgumentSynthesizer]: We have 224 Motzkin's Theorem applications. [2019-11-15 22:37:00,224 INFO L401 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2019-11-15 22:37:19,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:37:19,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-11-15 22:37:19,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:37:19,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:37:19,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:37:19,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:19,264 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:37:19,264 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:37:19,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:37:19,269 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-11-15 22:37:19,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:37:19,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:37:19,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:37:19,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:37:19,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:19,270 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:37:19,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:37:19,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:37:19,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:37:19,272 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:37:19,272 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:37:19,272 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:37:19,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:37:19,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:19,273 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:37:19,273 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:37:19,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:37:19,275 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-11-15 22:37:19,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:37:19,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:37:19,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:37:19,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:19,277 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:37:19,277 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:37:19,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:37:19,281 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-11-15 22:37:19,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:37:19,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:37:19,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:37:19,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:37:19,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:19,283 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:37:19,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:37:19,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:37:19,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-11-15 22:37:19,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:37:19,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:37:19,285 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:37:19,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:19,286 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:37:19,286 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:37:19,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:37:19,289 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-11-15 22:37:19,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:37:19,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:37:19,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:37:19,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:19,291 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:37:19,291 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:37:19,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:37:19,295 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-11-15 22:37:19,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:37:19,296 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:37:19,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:37:19,296 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:37:19,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:19,297 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:37:19,297 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:37:19,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:37:19,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:37:19,298 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:37:19,298 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:37:19,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:37:19,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:37:19,299 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:37:19,300 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:37:19,303 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:37:19,309 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:37:19,309 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:37:19,311 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:37:19,312 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:37:19,312 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:37:19,313 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2019-11-15 22:37:19,349 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 22:37:19,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:19,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:37:19,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:19,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:37:19,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:19,450 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-11-15 22:37:19,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-15 22:37:19,489 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 23 states and 32 transitions. Complement of second has 6 states. [2019-11-15 22:37:19,490 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-11-15 22:37:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:37:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 22:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2019-11-15 22:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-15 22:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2019-11-15 22:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:37:19,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-11-15 22:37:19,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:37:19,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2019-11-15 22:37:19,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:37:19,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 22:37:19,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-11-15 22:37:19,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:37:19,497 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-15 22:37:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-11-15 22:37:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 22:37:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:37:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-15 22:37:19,499 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 22:37:19,499 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 22:37:19,499 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:37:19,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-15 22:37:19,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:37:19,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:37:19,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:37:19,500 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:19,500 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 22:37:19,501 INFO L791 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 163#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 164#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 177#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 179#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 166#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 172#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 173#L532-4 assume !(main_~length~0 > 0); 176#L545-1 [2019-11-15 22:37:19,501 INFO L793 eck$LassoCheckResult]: Loop: 176#L545-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 176#L545-1 [2019-11-15 22:37:19,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2019-11-15 22:37:19,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:19,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574880170] [2019-11-15 22:37:19,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:19,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574880170] [2019-11-15 22:37:19,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:19,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:37:19,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079705078] [2019-11-15 22:37:19,543 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:37:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:19,544 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2019-11-15 22:37:19,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:19,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239668899] [2019-11-15 22:37:19,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:19,556 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:37:19,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:19,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:19,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:19,698 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 22:37:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:19,720 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-15 22:37:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:19,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-15 22:37:19,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:37:19,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2019-11-15 22:37:19,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:37:19,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 22:37:19,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2019-11-15 22:37:19,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:37:19,723 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-15 22:37:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2019-11-15 22:37:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-15 22:37:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:37:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-15 22:37:19,725 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 22:37:19,725 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 22:37:19,725 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:37:19,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-15 22:37:19,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:37:19,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:37:19,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:37:19,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:19,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 22:37:19,727 INFO L791 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 206#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 207#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 220#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 222#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 211#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 214#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 215#L532-4 assume main_~length~0 > 0; 208#L537 assume !(main_~length~0 < 0); 209#L537-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 219#L545-1 [2019-11-15 22:37:19,727 INFO L793 eck$LassoCheckResult]: Loop: 219#L545-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 219#L545-1 [2019-11-15 22:37:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2019-11-15 22:37:19,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:19,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778462270] [2019-11-15 22:37:19,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:19,761 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:37:19,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:19,762 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2019-11-15 22:37:19,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:19,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050235374] [2019-11-15 22:37:19,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:19,774 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:37:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2019-11-15 22:37:19,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:19,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125370610] [2019-11-15 22:37:19,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:19,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125370610] [2019-11-15 22:37:19,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:19,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:19,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063417781] [2019-11-15 22:37:19,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:19,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:37:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:19,940 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-15 22:37:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:19,969 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-15 22:37:19,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:37:19,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2019-11-15 22:37:19,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:37:19,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2019-11-15 22:37:19,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:37:19,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:37:19,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2019-11-15 22:37:19,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:37:19,973 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-15 22:37:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2019-11-15 22:37:19,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-15 22:37:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:37:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 22:37:19,975 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 22:37:19,975 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 22:37:19,975 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:37:19,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-15 22:37:19,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:37:19,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:37:19,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:37:19,977 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:19,977 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 22:37:19,977 INFO L791 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 264#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 265#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 277#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 268#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 269#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 274#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 275#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 278#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 280#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 279#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 272#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 273#L532-4 assume main_~length~0 > 0; 266#L537 assume !(main_~length~0 < 0); 267#L537-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 276#L545-1 [2019-11-15 22:37:19,977 INFO L793 eck$LassoCheckResult]: Loop: 276#L545-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 276#L545-1 [2019-11-15 22:37:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:19,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2019-11-15 22:37:19,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:19,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192594913] [2019-11-15 22:37:19,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:20,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192594913] [2019-11-15 22:37:20,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447189790] [2019-11-15 22:37:20,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e8feeb5-7b67-4c30-bc36-d05e0d462b8a/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-11-15 22:37:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:20,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 22:37:20,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:20,187 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:20,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2019-11-15 22:37:20,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:20,218 INFO L567 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-15 22:37:20,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:20,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:12 [2019-11-15 22:37:20,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-15 22:37:20,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:20,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:20,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:20,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-15 22:37:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:20,256 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:20,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-11-15 22:37:20,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58073246] [2019-11-15 22:37:20,257 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:37:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2019-11-15 22:37:20,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:20,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477083521] [2019-11-15 22:37:20,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:20,272 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:37:20,377 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-15 22:37:20,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:20,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:37:20,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:37:20,432 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-15 22:37:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:20,527 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-15 22:37:20,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:37:20,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-11-15 22:37:20,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:37:20,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-11-15 22:37:20,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 22:37:20,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 22:37:20,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-11-15 22:37:20,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:37:20,529 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-15 22:37:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-11-15 22:37:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 22:37:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:37:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-15 22:37:20,531 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-15 22:37:20,531 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-15 22:37:20,531 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:37:20,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-15 22:37:20,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 22:37:20,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:37:20,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:37:20,532 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:20,532 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 22:37:20,532 INFO L791 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 355#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 356#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 368#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 359#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 360#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 365#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 366#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 369#L523 assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 371#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 370#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 363#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 364#L532-4 assume main_~length~0 > 0; 357#L537 assume !(main_~length~0 < 0); 358#L537-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 367#L545-1 [2019-11-15 22:37:20,532 INFO L793 eck$LassoCheckResult]: Loop: 367#L545-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 367#L545-1 [2019-11-15 22:37:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:20,533 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2019-11-15 22:37:20,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:20,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057381573] [2019-11-15 22:37:20,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:20,639 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:37:20,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2019-11-15 22:37:20,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:20,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388372558] [2019-11-15 22:37:20,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:20,651 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:37:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:20,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2019-11-15 22:37:20,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:20,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426571289] [2019-11-15 22:37:20,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:37:20,739 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:37:25,830 WARN L191 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 315 DAG size of output: 244 [2019-11-15 22:37:26,452 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-11-15 22:37:26,456 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:37:26,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:37:26,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:37:26,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:37:26,456 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:37:26,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:37:26,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:37:26,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:37:26,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2019-11-15 22:37:26,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:37:26,457 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:37:26,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:37:26,904 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) 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) [2019-11-15 22:37:26,907 INFO L168 Benchmark]: Toolchain (without parser) took 41962.74 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 998.2 MB). Free memory was 935.7 MB in the beginning and 1.8 GB in the end (delta: -870.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:37:26,907 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:37:26,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:37:26,908 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:37:26,909 INFO L168 Benchmark]: Boogie Preprocessor took 29.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:37:26,909 INFO L168 Benchmark]: RCFGBuilder took 456.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:37:26,910 INFO L168 Benchmark]: BuchiAutomizer took 40926.82 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 861.4 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -714.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:37:26,913 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 500.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40926.82 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 861.4 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -714.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...