./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/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 2e43c76eef4a87266f6a401a44aa5422f52ed742 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:39:45,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:39:45,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:39:45,053 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:39:45,053 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:39:45,054 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:39:45,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:39:45,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:39:45,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:39:45,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:39:45,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:39:45,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:39:45,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:39:45,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:39:45,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:39:45,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:39:45,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:39:45,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:39:45,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:39:45,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:39:45,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:39:45,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:39:45,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:39:45,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:39:45,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:39:45,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:39:45,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:39:45,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:39:45,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:39:45,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:39:45,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:39:45,067 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:39:45,067 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:39:45,067 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:39:45,068 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:39:45,068 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:39:45,068 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 21:39:45,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:39:45,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:39:45,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:39:45,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:39:45,077 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:39:45,077 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 21:39:45,077 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 21:39:45,077 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 21:39:45,077 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 21:39:45,077 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 21:39:45,077 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 21:39:45,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 21:39:45,078 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:39:45,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 21:39:45,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:39:45,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:39:45,079 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 21:39:45,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:39:45,079 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:39:45,079 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 21:39:45,080 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 21:39:45,080 INFO L133 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/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/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 -> 2e43c76eef4a87266f6a401a44aa5422f52ed742 [2018-12-02 21:39:45,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:39:45,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:39:45,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:39:45,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:39:45,110 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:39:45,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-12-02 21:39:45,153 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/data/30dadd41c/adf2a53a3a5d4623b46c2870947599d0/FLAG33ded4fad [2018-12-02 21:39:45,623 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:39:45,623 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-12-02 21:39:45,630 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/data/30dadd41c/adf2a53a3a5d4623b46c2870947599d0/FLAG33ded4fad [2018-12-02 21:39:45,639 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/data/30dadd41c/adf2a53a3a5d4623b46c2870947599d0 [2018-12-02 21:39:45,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:39:45,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:39:45,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:39:45,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:39:45,644 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:39:45,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:45,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38aff2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45, skipping insertion in model container [2018-12-02 21:39:45,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:45,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:39:45,674 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:39:45,887 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:39:45,899 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:39:45,934 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:39:45,967 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:39:45,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45 WrapperNode [2018-12-02 21:39:45,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:39:45,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:39:45,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:39:45,968 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:39:45,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:45,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:46,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:39:46,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:39:46,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:39:46,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:39:46,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:46,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:46,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:46,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:46,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:46,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:46,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... [2018-12-02 21:39:46,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:39:46,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:39:46,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:39:46,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:39:46,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/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 [2018-12-02 21:39:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:39:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 21:39:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 21:39:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:39:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 21:39:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:39:46,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:39:46,229 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:39:46,229 INFO L280 CfgBuilder]: Removed 20 assue(true) statements. [2018-12-02 21:39:46,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:39:46 BoogieIcfgContainer [2018-12-02 21:39:46,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:39:46,230 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 21:39:46,230 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 21:39:46,232 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 21:39:46,232 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:39:46,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 09:39:45" (1/3) ... [2018-12-02 21:39:46,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2adc7974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:39:46, skipping insertion in model container [2018-12-02 21:39:46,233 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:39:46,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:45" (2/3) ... [2018-12-02 21:39:46,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2adc7974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:39:46, skipping insertion in model container [2018-12-02 21:39:46,233 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:39:46,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:39:46" (3/3) ... [2018-12-02 21:39:46,234 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-12-02 21:39:46,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:39:46,264 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 21:39:46,264 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 21:39:46,264 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 21:39:46,264 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:39:46,264 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:39:46,264 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 21:39:46,265 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:39:46,265 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 21:39:46,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-02 21:39:46,286 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-02 21:39:46,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:46,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:46,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:46,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:46,290 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 21:39:46,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-02 21:39:46,291 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-02 21:39:46,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:46,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:46,291 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:46,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:46,295 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 6#L-1true havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 16#L1065true assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 15#L1066true entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 8#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 18#L1076true entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 7#L1470true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 27#L1471-3true [2018-12-02 21:39:46,295 INFO L796 eck$LassoCheckResult]: Loop: 27#L1471-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 21#L1471-2true entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 27#L1471-3true [2018-12-02 21:39:46,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:46,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815372, now seen corresponding path program 1 times [2018-12-02 21:39:46,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:46,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:46,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:46,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:39:46,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:39:46,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:39:46,402 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 21:39:46,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:46,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2018-12-02 21:39:46,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:46,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:46,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:46,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:46,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:39:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:39:46,488 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2018-12-02 21:39:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:39:46,527 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-12-02 21:39:46,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:39:46,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2018-12-02 21:39:46,529 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2018-12-02 21:39:46,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 44 transitions. [2018-12-02 21:39:46,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-12-02 21:39:46,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-12-02 21:39:46,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-12-02 21:39:46,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:39:46,533 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-12-02 21:39:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-12-02 21:39:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-12-02 21:39:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 21:39:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-02 21:39:46,551 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-02 21:39:46,551 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-02 21:39:46,551 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 21:39:46,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-12-02 21:39:46,552 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-02 21:39:46,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:46,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:46,552 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:46,552 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:46,553 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 94#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 95#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 90#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 91#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 96#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 97#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 101#L1471-3 [2018-12-02 21:39:46,553 INFO L796 eck$LassoCheckResult]: Loop: 101#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 102#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 101#L1471-3 [2018-12-02 21:39:46,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:46,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1806813450, now seen corresponding path program 1 times [2018-12-02 21:39:46,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:46,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:46,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:46,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:46,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2018-12-02 21:39:46,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:46,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:46,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:46,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:46,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938732, now seen corresponding path program 1 times [2018-12-02 21:39:46,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:46,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:39:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:46,764 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2018-12-02 21:39:46,818 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:39:46,819 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:39:46,819 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:39:46,819 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:39:46,819 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:39:46,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:39:46,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:39:46,820 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:39:46,820 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-02 21:39:46,820 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:39:46,820 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:39:46,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:46,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:47,234 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:39:47,238 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:39:47,239 INFO L122 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 [2018-12-02 21:39:47,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:47,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:47,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:47,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,244 INFO L122 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 [2018-12-02 21:39:47,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,249 INFO L122 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 [2018-12-02 21:39:47,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,254 INFO L122 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 [2018-12-02 21:39:47,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:47,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:47,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:47,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,256 INFO L122 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 [2018-12-02 21:39:47,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,261 INFO L122 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 [2018-12-02 21:39:47,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:47,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:47,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:47,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,264 INFO L122 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 [2018-12-02 21:39:47,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,270 INFO L122 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 [2018-12-02 21:39:47,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,275 INFO L122 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 [2018-12-02 21:39:47,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:47,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:47,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:47,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,278 INFO L122 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 [2018-12-02 21:39:47,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,283 INFO L122 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 [2018-12-02 21:39:47,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,289 INFO L122 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 [2018-12-02 21:39:47,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,295 INFO L122 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 [2018-12-02 21:39:47,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:47,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:47,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:47,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,297 INFO L122 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 [2018-12-02 21:39:47,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,303 INFO L122 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 [2018-12-02 21:39:47,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,304 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:39:47,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,306 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:39:47,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,319 INFO L122 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 [2018-12-02 21:39:47,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,323 INFO L122 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 [2018-12-02 21:39:47,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:47,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:47,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:47,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,325 INFO L122 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 [2018-12-02 21:39:47,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:47,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:47,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:47,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,327 INFO L122 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 [2018-12-02 21:39:47,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:47,332 INFO L122 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 [2018-12-02 21:39:47,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:47,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:47,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:47,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:47,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:47,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:47,370 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:39:47,409 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-02 21:39:47,409 INFO L444 ModelExtractionUtils]: 31 out of 43 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-02 21:39:47,410 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:39:47,411 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:39:47,412 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:39:47,412 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~array~0.offset, v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1, ULTIMATE.start_entry_point_~i~2) = -1*ULTIMATE.start_entry_point_~array~0.offset + 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1 - 4*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2018-12-02 21:39:47,434 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-02 21:39:47,439 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 21:39:47,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:47,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:39:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:47,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:39:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:39:47,495 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 21:39:47,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 21:39:47,542 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 52 states and 69 transitions. Complement of second has 7 states. [2018-12-02 21:39:47,542 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 [2018-12-02 21:39:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 21:39:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-12-02 21:39:47,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-02 21:39:47,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:47,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-02 21:39:47,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:47,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 21:39:47,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:47,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 69 transitions. [2018-12-02 21:39:47,547 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2018-12-02 21:39:47,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 37 states and 48 transitions. [2018-12-02 21:39:47,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-02 21:39:47,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-12-02 21:39:47,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 48 transitions. [2018-12-02 21:39:47,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:39:47,549 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-02 21:39:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 48 transitions. [2018-12-02 21:39:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-12-02 21:39:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 21:39:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-12-02 21:39:47,551 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-02 21:39:47,551 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-02 21:39:47,551 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 21:39:47,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2018-12-02 21:39:47,551 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 21:39:47,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:47,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:47,552 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:47,552 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 21:39:47,552 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 248#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 249#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 244#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 245#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 250#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 251#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 255#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 261#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 240#L1444-3 [2018-12-02 21:39:47,553 INFO L796 eck$LassoCheckResult]: Loop: 240#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 242#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 252#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 253#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 239#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 240#L1444-3 [2018-12-02 21:39:47,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938674, now seen corresponding path program 1 times [2018-12-02 21:39:47,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:47,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:47,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:47,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:39:47,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:39:47,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:39:47,588 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 21:39:47,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 1 times [2018-12-02 21:39:47,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:47,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:47,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:47,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:47,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:39:47,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:39:47,731 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-02 21:39:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:39:47,759 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2018-12-02 21:39:47,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:39:47,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-12-02 21:39:47,760 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2018-12-02 21:39:47,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2018-12-02 21:39:47,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-12-02 21:39:47,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-12-02 21:39:47,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2018-12-02 21:39:47,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:39:47,761 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-02 21:39:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2018-12-02 21:39:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2018-12-02 21:39:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 21:39:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-12-02 21:39:47,762 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-12-02 21:39:47,762 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-12-02 21:39:47,762 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 21:39:47,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-12-02 21:39:47,763 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 21:39:47,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:47,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:47,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:47,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 21:39:47,763 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 330#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 331#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 326#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 327#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 344#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 348#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 347#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 345#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 322#L1444-3 [2018-12-02 21:39:47,763 INFO L796 eck$LassoCheckResult]: Loop: 322#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 324#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 335#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 336#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 321#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 322#L1444-3 [2018-12-02 21:39:47,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:47,764 INFO L82 PathProgramCache]: Analyzing trace with hash -594068688, now seen corresponding path program 1 times [2018-12-02 21:39:47,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:47,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:47,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:47,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:39:47,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:39:47,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:39:47,786 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 21:39:47,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:47,786 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 2 times [2018-12-02 21:39:47,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:47,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:47,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:39:47,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:39:47,935 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-02 21:39:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:39:47,954 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-12-02 21:39:47,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:39:47,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2018-12-02 21:39:47,955 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 21:39:47,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 36 transitions. [2018-12-02 21:39:47,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 21:39:47,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-02 21:39:47,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2018-12-02 21:39:47,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:39:47,956 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-12-02 21:39:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2018-12-02 21:39:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-02 21:39:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 21:39:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-12-02 21:39:47,957 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-12-02 21:39:47,957 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-12-02 21:39:47,957 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 21:39:47,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-12-02 21:39:47,958 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 21:39:47,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:47,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:47,958 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:47,958 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 21:39:47,958 INFO L794 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 401#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 402#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 397#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 398#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 403#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 404#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 408#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 409#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 410#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 414#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 393#L1444-3 [2018-12-02 21:39:47,958 INFO L796 eck$LassoCheckResult]: Loop: 393#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 395#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 405#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 406#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 392#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 393#L1444-3 [2018-12-02 21:39:47,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:47,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1010756116, now seen corresponding path program 1 times [2018-12-02 21:39:47,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:47,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:47,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:39:47,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:47,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:47,968 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 3 times [2018-12-02 21:39:47,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:47,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:47,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash 754630971, now seen corresponding path program 1 times [2018-12-02 21:39:47,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:47,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:39:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:48,325 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 118 [2018-12-02 21:39:48,405 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:39:48,405 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:39:48,405 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:39:48,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:39:48,405 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:39:48,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:39:48,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:39:48,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:39:48,406 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-02 21:39:48,406 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:39:48,406 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:39:48,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:48,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:39:48,989 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:39:48,989 INFO L122 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 [2018-12-02 21:39:48,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:48,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:48,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:48,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:48,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:48,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:48,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:48,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:48,992 INFO L122 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 [2018-12-02 21:39:48,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:48,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:48,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:48,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:48,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:48,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:48,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:48,996 INFO L122 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 [2018-12-02 21:39:48,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:48,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:48,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:48,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:48,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:48,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:48,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:48,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:48,997 INFO L122 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 [2018-12-02 21:39:48,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:48,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:48,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:48,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:48,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:48,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:48,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:48,999 INFO L122 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 [2018-12-02 21:39:48,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:48,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:48,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:48,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,001 INFO L122 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 [2018-12-02 21:39:49,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,003 INFO L122 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 [2018-12-02 21:39:49,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,006 INFO L122 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 [2018-12-02 21:39:49,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,009 INFO L122 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 [2018-12-02 21:39:49,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,011 INFO L122 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 [2018-12-02 21:39:49,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:49,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:49,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:49,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,013 INFO L122 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 [2018-12-02 21:39:49,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,015 INFO L122 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 [2018-12-02 21:39:49,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:49,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:49,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:49,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,017 INFO L122 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 [2018-12-02 21:39:49,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,019 INFO L122 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 [2018-12-02 21:39:49,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,022 INFO L122 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 [2018-12-02 21:39:49,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:49,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:49,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:49,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,024 INFO L122 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 [2018-12-02 21:39:49,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,024 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:39:49,024 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 21:39:49,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,027 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 21:39:49,027 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 21:39:49,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,039 INFO L122 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 [2018-12-02 21:39:49,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,042 INFO L122 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 [2018-12-02 21:39:49,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,045 INFO L122 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 [2018-12-02 21:39:49,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,045 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:39:49,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,046 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:39:49,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,047 INFO L122 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 [2018-12-02 21:39:49,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:49,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:49,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:49,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:49,049 INFO L122 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 [2018-12-02 21:39:49,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:49,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:49,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:49,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:49,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:49,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:49,075 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:39:49,092 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 21:39:49,092 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 21:39:49,093 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:39:49,093 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:39:49,093 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:39:49,093 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2018-12-02 21:39:49,127 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 21:39:49,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:49,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:39:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:49,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:39:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:39:49,165 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 21:39:49,165 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 21:39:49,178 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 43 states and 56 transitions. Complement of second has 6 states. [2018-12-02 21:39:49,178 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 [2018-12-02 21:39:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 21:39:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-12-02 21:39:49,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-02 21:39:49,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:49,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-02 21:39:49,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:49,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-02 21:39:49,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:49,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2018-12-02 21:39:49,180 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 21:39:49,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 31 states and 40 transitions. [2018-12-02 21:39:49,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-02 21:39:49,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 21:39:49,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-12-02 21:39:49,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:39:49,181 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-12-02 21:39:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-12-02 21:39:49,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-12-02 21:39:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 21:39:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-02 21:39:49,183 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-02 21:39:49,183 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-02 21:39:49,183 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 21:39:49,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-12-02 21:39:49,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 21:39:49,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:49,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:49,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:49,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:49,185 INFO L794 eck$LassoCheckResult]: Stem: 585#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 575#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 576#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 573#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 574#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 579#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 580#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 586#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 587#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 588#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 592#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 568#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 569#L1444-4 alloc_17_#res := 0; 572#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 591#L1460-3 [2018-12-02 21:39:49,185 INFO L796 eck$LassoCheckResult]: Loop: 591#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 590#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 591#L1460-3 [2018-12-02 21:39:49,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash -580221115, now seen corresponding path program 1 times [2018-12-02 21:39:49,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:39:49,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:39:49,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:39:49,205 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 21:39:49,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2018-12-02 21:39:49,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:49,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:39:49,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:39:49,232 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-02 21:39:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:39:49,289 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-12-02 21:39:49,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:39:49,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 86 transitions. [2018-12-02 21:39:49,290 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2018-12-02 21:39:49,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 86 transitions. [2018-12-02 21:39:49,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-12-02 21:39:49,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-12-02 21:39:49,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 86 transitions. [2018-12-02 21:39:49,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:39:49,290 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 86 transitions. [2018-12-02 21:39:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 86 transitions. [2018-12-02 21:39:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2018-12-02 21:39:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 21:39:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-12-02 21:39:49,292 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-02 21:39:49,292 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-02 21:39:49,292 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 21:39:49,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2018-12-02 21:39:49,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 21:39:49,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:49,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:49,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:49,293 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:49,293 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 684#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 685#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 680#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 681#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 687#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 688#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 703#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 696#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 697#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 704#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 705#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 678#L1444-4 alloc_17_#res := 0; 679#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 700#L1460-3 [2018-12-02 21:39:49,293 INFO L796 eck$LassoCheckResult]: Loop: 700#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 699#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 700#L1460-3 [2018-12-02 21:39:49,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash -838386553, now seen corresponding path program 1 times [2018-12-02 21:39:49,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:39:49,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:39:49,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:39:49,311 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 21:39:49,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2018-12-02 21:39:49,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:49,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:39:49,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:39:49,332 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-02 21:39:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:39:49,364 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-12-02 21:39:49,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:39:49,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2018-12-02 21:39:49,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 21:39:49,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 64 transitions. [2018-12-02 21:39:49,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-02 21:39:49,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-02 21:39:49,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2018-12-02 21:39:49,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:39:49,367 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 64 transitions. [2018-12-02 21:39:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2018-12-02 21:39:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-12-02 21:39:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 21:39:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-02 21:39:49,368 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-02 21:39:49,368 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-02 21:39:49,368 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 21:39:49,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-02 21:39:49,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 21:39:49,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:49,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:49,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:49,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:49,370 INFO L794 eck$LassoCheckResult]: Stem: 792#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 784#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 785#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 780#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 781#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 786#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 787#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 793#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 794#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 795#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 799#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 775#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 777#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 788#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 789#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 800#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 783#L1451-3 [2018-12-02 21:39:49,370 INFO L796 eck$LassoCheckResult]: Loop: 783#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 782#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 783#L1451-3 [2018-12-02 21:39:49,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,370 INFO L82 PathProgramCache]: Analyzing trace with hash 754690497, now seen corresponding path program 1 times [2018-12-02 21:39:49,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:39:49,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2018-12-02 21:39:49,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:49,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash -591903197, now seen corresponding path program 1 times [2018-12-02 21:39:49,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:39:49,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:39:49,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:39:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:39:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:39:49,487 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 21:39:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:39:49,544 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-12-02 21:39:49,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:39:49,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 87 transitions. [2018-12-02 21:39:49,544 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2018-12-02 21:39:49,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 87 transitions. [2018-12-02 21:39:49,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-12-02 21:39:49,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-12-02 21:39:49,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2018-12-02 21:39:49,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:39:49,545 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-12-02 21:39:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2018-12-02 21:39:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2018-12-02 21:39:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 21:39:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-12-02 21:39:49,547 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-12-02 21:39:49,547 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-12-02 21:39:49,547 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 21:39:49,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2018-12-02 21:39:49,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 21:39:49,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:49,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:49,548 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:49,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:49,548 INFO L794 eck$LassoCheckResult]: Stem: 916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 905#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 906#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 907#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 925#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 926#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 917#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 918#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 930#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 928#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 929#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 896#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 897#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 914#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 915#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 894#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 895#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 900#L1444-4 alloc_17_#res := 0; 902#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 924#L1460-3 [2018-12-02 21:39:49,548 INFO L796 eck$LassoCheckResult]: Loop: 924#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 923#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 924#L1460-3 [2018-12-02 21:39:49,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash 420857150, now seen corresponding path program 1 times [2018-12-02 21:39:49,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:39:49,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:39:49,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:39:49,566 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 21:39:49,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 3 times [2018-12-02 21:39:49,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:49,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:39:49,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:39:49,584 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-12-02 21:39:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:39:49,597 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2018-12-02 21:39:49,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:39:49,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2018-12-02 21:39:49,598 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-02 21:39:49,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 63 states and 76 transitions. [2018-12-02 21:39:49,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-12-02 21:39:49,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-12-02 21:39:49,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 76 transitions. [2018-12-02 21:39:49,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:39:49,599 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 76 transitions. [2018-12-02 21:39:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 76 transitions. [2018-12-02 21:39:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2018-12-02 21:39:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 21:39:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-12-02 21:39:49,600 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-12-02 21:39:49,601 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-12-02 21:39:49,601 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 21:39:49,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2018-12-02 21:39:49,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 21:39:49,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:49,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:49,602 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:49,602 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:49,602 INFO L794 eck$LassoCheckResult]: Stem: 1038#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1027#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1028#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1025#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1026#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1032#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1033#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1063#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1051#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1049#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1050#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1019#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1020#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1062#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1061#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1060#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1059#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1022#L1444-4 alloc_17_#res := 0; 1024#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1046#L1460-3 [2018-12-02 21:39:49,602 INFO L796 eck$LassoCheckResult]: Loop: 1046#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1045#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1046#L1460-3 [2018-12-02 21:39:49,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1354150212, now seen corresponding path program 1 times [2018-12-02 21:39:49,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:39:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 4 times [2018-12-02 21:39:49,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:49,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash 36739678, now seen corresponding path program 1 times [2018-12-02 21:39:49,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:49,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:39:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:50,463 WARN L180 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 184 [2018-12-02 21:39:50,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:39:50,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:39:50,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:39:50,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:289, output treesize:290 [2018-12-02 21:39:50,816 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-02 21:39:50,818 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:39:50,818 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:39:50,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:39:50,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:39:50,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:39:50,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:39:50,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:39:50,818 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:39:50,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration10_Lasso [2018-12-02 21:39:50,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:39:50,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:39:50,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:50,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:50,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:50,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:50,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,135 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-12-02 21:39:51,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:51,623 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:39:51,623 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:39:51,624 INFO L122 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 [2018-12-02 21:39:51,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:51,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:51,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:51,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:51,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:51,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:51,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:51,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:51,625 INFO L122 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 [2018-12-02 21:39:51,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:51,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:51,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:51,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:51,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:51,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:51,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:51,627 INFO L122 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 [2018-12-02 21:39:51,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:51,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:51,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:51,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:51,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:51,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:51,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:51,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:51,628 INFO L122 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 [2018-12-02 21:39:51,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:51,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:51,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:51,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:51,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:51,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:51,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:51,629 INFO L122 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 [2018-12-02 21:39:51,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:51,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:51,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:51,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:51,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:51,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:51,647 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:39:51,657 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 21:39:51,658 INFO L444 ModelExtractionUtils]: 45 out of 55 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-02 21:39:51,658 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:39:51,658 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:39:51,659 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:39:51,659 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~array.offset, v_rep(select #length ULTIMATE.start_free_17_~array.base)_1) = -4*ULTIMATE.start_free_17_~i~1 - 1*ULTIMATE.start_free_17_~array.offset + 1*v_rep(select #length ULTIMATE.start_free_17_~array.base)_1 Supporting invariants [] [2018-12-02 21:39:51,695 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2018-12-02 21:39:51,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 21:39:51,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:51,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:39:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:51,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:39:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:39:51,730 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 21:39:51,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-12-02 21:39:51,737 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 49 states and 62 transitions. Complement of second has 4 states. [2018-12-02 21:39:51,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 21:39:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 21:39:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2018-12-02 21:39:51,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 2 letters. [2018-12-02 21:39:51,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:51,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 21 letters. Loop has 2 letters. [2018-12-02 21:39:51,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:51,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-02 21:39:51,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:51,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 62 transitions. [2018-12-02 21:39:51,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 21:39:51,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 23 states and 26 transitions. [2018-12-02 21:39:51,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 21:39:51,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 21:39:51,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-12-02 21:39:51,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:39:51,739 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-02 21:39:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-12-02 21:39:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 21:39:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 21:39:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-02 21:39:51,739 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-02 21:39:51,740 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-02 21:39:51,740 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 21:39:51,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-12-02 21:39:51,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 21:39:51,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:51,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:51,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:51,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:51,740 INFO L794 eck$LassoCheckResult]: Stem: 1289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1279#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1280#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1277#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1278#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1283#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1284#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1290#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1291#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1292#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1293#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1274#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1275#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1287#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1288#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1272#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1273#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1276#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1285#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1286#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1294#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1282#L1451-3 [2018-12-02 21:39:51,740 INFO L796 eck$LassoCheckResult]: Loop: 1282#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1281#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1282#L1451-3 [2018-12-02 21:39:51,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash 38170488, now seen corresponding path program 1 times [2018-12-02 21:39:51,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:51,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:51,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:39:51,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:39:51,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55ab5e8f-dba9-4778-90c1-e39dee9d31f0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:39:51,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:51,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:39:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:39:51,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:39:51,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-12-02 21:39:51,876 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 21:39:51,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 2 times [2018-12-02 21:39:51,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:51,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:51,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:51,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:39:51,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 21:39:51,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:39:51,932 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 15 states. [2018-12-02 21:39:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:39:52,038 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-12-02 21:39:52,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:39:52,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-12-02 21:39:52,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 21:39:52,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 29 transitions. [2018-12-02 21:39:52,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 21:39:52,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 21:39:52,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-12-02 21:39:52,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:39:52,039 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-12-02 21:39:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-12-02 21:39:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-02 21:39:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 21:39:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-02 21:39:52,040 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-02 21:39:52,040 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-02 21:39:52,040 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 21:39:52,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-12-02 21:39:52,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 21:39:52,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:39:52,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:39:52,041 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:39:52,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 21:39:52,041 INFO L794 eck$LassoCheckResult]: Stem: 1438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1430#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1431#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1426#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1427#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1432#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1433#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1439#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1440#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1441#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1442#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1445#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1443#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1423#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1424#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1436#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1437#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1421#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1422#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1425#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1434#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1435#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1444#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1429#L1451-3 [2018-12-02 21:39:52,041 INFO L796 eck$LassoCheckResult]: Loop: 1429#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1428#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1429#L1451-3 [2018-12-02 21:39:52,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2124874406, now seen corresponding path program 2 times [2018-12-02 21:39:52,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:52,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:52,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:52,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:39:52,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:52,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 3 times [2018-12-02 21:39:52,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:52,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:52,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:39:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:52,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:52,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1894836356, now seen corresponding path program 1 times [2018-12-02 21:39:52,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:39:52,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:39:52,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:52,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:39:52,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:39:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:39:53,272 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 241 DAG size of output: 207 [2018-12-02 21:39:53,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:39:53,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:39:53,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:39:53,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:39:53,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 21:39:53,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:306, output treesize:298 [2018-12-02 21:39:53,790 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-12-02 21:39:53,792 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:39:53,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:39:53,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:39:53,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:39:53,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:39:53,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:39:53,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:39:53,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:39:53,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration12_Lasso [2018-12-02 21:39:53,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:39:53,793 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:39:53,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:53,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:39:54,323 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:39:54,323 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:39:54,323 INFO L122 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 [2018-12-02 21:39:54,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:54,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:54,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:54,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,324 INFO L122 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 [2018-12-02 21:39:54,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,326 INFO L122 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 [2018-12-02 21:39:54,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,327 INFO L122 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 [2018-12-02 21:39:54,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,329 INFO L122 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 [2018-12-02 21:39:54,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:54,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:54,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:54,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,330 INFO L122 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 [2018-12-02 21:39:54,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,331 INFO L122 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 [2018-12-02 21:39:54,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:54,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:54,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:54,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,332 INFO L122 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 [2018-12-02 21:39:54,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,333 INFO L122 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 [2018-12-02 21:39:54,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,335 INFO L122 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 [2018-12-02 21:39:54,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:54,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:54,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:54,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,336 INFO L122 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 [2018-12-02 21:39:54,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,337 INFO L122 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 [2018-12-02 21:39:54,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,338 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:39:54,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,338 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:39:54,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,340 INFO L122 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 [2018-12-02 21:39:54,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,341 INFO L122 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 [2018-12-02 21:39:54,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:54,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:54,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:54,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,342 INFO L122 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 [2018-12-02 21:39:54,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:39:54,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:39:54,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:39:54,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,343 INFO L122 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 [2018-12-02 21:39:54,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,345 INFO L122 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 [2018-12-02 21:39:54,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,345 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:39:54,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,345 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:39:54,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:39:54,346 INFO L122 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 [2018-12-02 21:39:54,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:39:54,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:39:54,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:39:54,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:39:54,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:39:54,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:39:54,353 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:39:54,359 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 21:39:54,360 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 21:39:54,360 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:39:54,360 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:39:54,360 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:39:54,360 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2018-12-02 21:39:54,379 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 21:39:54,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:39:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:54,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:39:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:39:54,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:39:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:39:54,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 21:39:54,413 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 21:39:54,421 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 27 states and 31 transitions. Complement of second has 4 states. [2018-12-02 21:39:54,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 21:39:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 21:39:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-12-02 21:39:54,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 2 letters. [2018-12-02 21:39:54,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:54,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 25 letters. Loop has 2 letters. [2018-12-02 21:39:54,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:54,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 4 letters. [2018-12-02 21:39:54,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:39:54,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-12-02 21:39:54,422 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 21:39:54,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-12-02 21:39:54,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 21:39:54,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 21:39:54,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 21:39:54,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:39:54,423 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:39:54,423 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:39:54,423 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:39:54,423 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 21:39:54,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:39:54,423 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 21:39:54,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 21:39:54,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 09:39:54 BoogieIcfgContainer [2018-12-02 21:39:54,428 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 21:39:54,428 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:39:54,428 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:39:54,428 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:39:54,429 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:39:46" (3/4) ... [2018-12-02 21:39:54,431 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 21:39:54,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:39:54,431 INFO L168 Benchmark]: Toolchain (without parser) took 8789.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -119.3 MB). Peak memory consumption was 233.6 MB. Max. memory is 11.5 GB. [2018-12-02 21:39:54,432 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:39:54,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -130.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:39:54,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:39:54,432 INFO L168 Benchmark]: Boogie Preprocessor took 21.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:39:54,433 INFO L168 Benchmark]: RCFGBuilder took 198.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-02 21:39:54,433 INFO L168 Benchmark]: BuchiAutomizer took 8198.25 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.1 MB). Peak memory consumption was 224.5 MB. Max. memory is 11.5 GB. [2018-12-02 21:39:54,434 INFO L168 Benchmark]: Witness Printer took 2.71 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:39:54,436 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -130.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 198.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8198.25 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.1 MB). Peak memory consumption was 224.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.71 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * array + unknown-#length-unknown[array] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -4 * i + -1 * array + unknown-#length-unknown[array] and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 7.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 145 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 376 SDtfs, 525 SDslu, 580 SDs, 0 SdLazy, 323 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital314 mio100 ax110 hnf100 lsp85 ukn59 mio100 lsp54 div100 bol100 ite100 ukn100 eq191 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 5 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...