./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/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 fcf7d7a4067ef9712cccdc61e57c274773cdfd53 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:12:20,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:12:20,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:12:20,752 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:12:20,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:12:20,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:12:20,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:12:20,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:12:20,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:12:20,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:12:20,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:12:20,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:12:20,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:12:20,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:12:20,758 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:12:20,759 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:12:20,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:12:20,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:12:20,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:12:20,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:12:20,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:12:20,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:12:20,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:12:20,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:12:20,767 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:12:20,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:12:20,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:12:20,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:12:20,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:12:20,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:12:20,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:12:20,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:12:20,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:12:20,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:12:20,772 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:12:20,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:12:20,773 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 05:12:20,785 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:12:20,786 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:12:20,787 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:12:20,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:12:20,787 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:12:20,787 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:12:20,787 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:12:20,787 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:12:20,788 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:12:20,788 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:12:20,788 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:12:20,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:12:20,788 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:12:20,788 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:12:20,788 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:12:20,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:12:20,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:12:20,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:12:20,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:12:20,789 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:12:20,789 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:12:20,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:12:20,790 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:12:20,790 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:12:20,790 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:12:20,790 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:12:20,790 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:12:20,790 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:12:20,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:12:20,791 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:12:20,791 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:12:20,792 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:12:20,792 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_88d51d84-14de-48f7-aef4-ef599c384932/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 -> fcf7d7a4067ef9712cccdc61e57c274773cdfd53 [2018-11-23 05:12:20,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:12:20,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:12:20,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:12:20,835 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:12:20,835 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:12:20,835 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-11-23 05:12:20,889 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/data/9eeaf9136/b4cf39dbb83448f1851f89a96c6a618b/FLAG297f62302 [2018-11-23 05:12:21,315 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:12:21,316 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-11-23 05:12:21,327 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/data/9eeaf9136/b4cf39dbb83448f1851f89a96c6a618b/FLAG297f62302 [2018-11-23 05:12:21,341 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/data/9eeaf9136/b4cf39dbb83448f1851f89a96c6a618b [2018-11-23 05:12:21,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:12:21,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:12:21,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:12:21,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:12:21,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:12:21,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ab2f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21, skipping insertion in model container [2018-11-23 05:12:21,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:12:21,408 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:12:21,759 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:12:21,770 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:12:21,818 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:12:21,866 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:12:21,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21 WrapperNode [2018-11-23 05:12:21,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:12:21,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:12:21,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:12:21,868 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:12:21,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:12:21,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:12:21,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:12:21,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:12:21,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... [2018-11-23 05:12:21,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:12:21,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:12:21,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:12:21,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:12:21,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/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-11-23 05:12:21,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:12:21,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:12:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:12:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:12:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 05:12:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:12:21,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:12:22,189 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:12:22,189 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 05:12:22,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:12:22 BoogieIcfgContainer [2018-11-23 05:12:22,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:12:22,190 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:12:22,190 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:12:22,194 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:12:22,194 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:12:22,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:12:21" (1/3) ... [2018-11-23 05:12:22,195 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e5abd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:12:22, skipping insertion in model container [2018-11-23 05:12:22,196 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:12:22,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:12:21" (2/3) ... [2018-11-23 05:12:22,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e5abd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:12:22, skipping insertion in model container [2018-11-23 05:12:22,196 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:12:22,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:12:22" (3/3) ... [2018-11-23 05:12:22,197 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-11-23 05:12:22,238 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:12:22,239 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:12:22,239 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:12:22,239 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:12:22,239 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:12:22,239 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:12:22,239 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:12:22,239 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:12:22,240 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:12:22,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 05:12:22,274 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 05:12:22,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:22,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:22,281 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:22,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:12:22,281 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:12:22,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 05:12:22,282 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 05:12:22,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:22,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:22,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:22,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:12:22,287 INFO L794 eck$LassoCheckResult]: Stem: 13#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); 10#L-1true havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 16#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 11#L1076true entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 20#L1468true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 26#L1469-3true [2018-11-23 05:12:22,287 INFO L796 eck$LassoCheckResult]: Loop: 26#L1469-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#L1469-2true entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 26#L1469-3true [2018-11-23 05:12:22,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2018-11-23 05:12:22,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:22,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:22,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:12:22,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:12:22,443 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:22,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2018-11-23 05:12:22,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:22,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:22,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:12:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:12:22,575 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2018-11-23 05:12:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:22,634 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 05:12:22,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:12:22,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2018-11-23 05:12:22,638 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2018-11-23 05:12:22,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 33 states and 41 transitions. [2018-11-23 05:12:22,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 05:12:22,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 05:12:22,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-23 05:12:22,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:22,645 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-23 05:12:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-23 05:12:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-11-23 05:12:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 05:12:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-23 05:12:22,672 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-23 05:12:22,672 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-23 05:12:22,673 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:12:22,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-11-23 05:12:22,673 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 05:12:22,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:22,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:22,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:22,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:12:22,674 INFO L794 eck$LassoCheckResult]: Stem: 96#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); 90#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 92#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 93#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 100#L1469-3 [2018-11-23 05:12:22,674 INFO L796 eck$LassoCheckResult]: Loop: 100#L1469-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); 101#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 100#L1469-3 [2018-11-23 05:12:22,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2018-11-23 05:12:22,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:22,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:22,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:22,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2018-11-23 05:12:22,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:22,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:22,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2018-11-23 05:12:22,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:22,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:22,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:22,958 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-23 05:12:23,030 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:12:23,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:12:23,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:12:23,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:12:23,032 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:12:23,032 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:12:23,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:12:23,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:12:23,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-23 05:12:23,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:12:23,033 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:12:23,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,228 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-11-23 05:12:23,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:12:23,624 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:12:23,628 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:12:23,630 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-11-23 05:12:23,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:12:23,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:12:23,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:12:23,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:12:23,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:12:23,636 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-11-23 05:12:23,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:12:23,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:12:23,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:12:23,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:12:23,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:12:23,639 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-11-23 05:12:23,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:12:23,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:12:23,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:12:23,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:12:23,648 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-11-23 05:12:23,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,650 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:12:23,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,654 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:12:23,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:12:23,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:12:23,674 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-11-23 05:12:23,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:12:23,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:12:23,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:12:23,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:12:23,682 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-11-23 05:12:23,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:12:23,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:12:23,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:12:23,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:12:23,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:12:23,687 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-11-23 05:12:23,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:12:23,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:12:23,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:12:23,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:12:23,701 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-11-23 05:12:23,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:12:23,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:12:23,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:12:23,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:12:23,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:12:23,705 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-11-23 05:12:23,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:12:23,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:12:23,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:12:23,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:12:23,711 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-11-23 05:12:23,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:12:23,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:12:23,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:12:23,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:12:23,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:12:23,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:12:23,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:12:23,788 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:12:23,789 INFO L444 ModelExtractionUtils]: 19 out of 31 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-23 05:12:23,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:12:23,792 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:12:23,793 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:12:23,794 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1, ULTIMATE.start_entry_point_~array~0.offset, ULTIMATE.start_entry_point_~i~2) = 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1 - 1*ULTIMATE.start_entry_point_~array~0.offset - 4*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2018-11-23 05:12:23,823 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 05:12:23,830 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:12:23,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:23,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:23,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:23,884 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-11-23 05:12:23,884 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 05:12:23,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 50 states and 66 transitions. Complement of second has 7 states. [2018-11-23 05:12:23,947 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-11-23 05:12:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:12:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 05:12:23,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 05:12:23,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:12:23,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 05:12:23,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:12:23,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 05:12:23,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:12:23,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2018-11-23 05:12:23,955 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2018-11-23 05:12:23,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 35 states and 45 transitions. [2018-11-23 05:12:23,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-23 05:12:23,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 05:12:23,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2018-11-23 05:12:23,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:23,957 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-23 05:12:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2018-11-23 05:12:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-11-23 05:12:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 05:12:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-23 05:12:23,959 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 05:12:23,959 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 05:12:23,959 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:12:23,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-23 05:12:23,960 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:23,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:23,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:23,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:23,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:23,961 INFO L794 eck$LassoCheckResult]: Stem: 240#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); 234#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 235#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; 236#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 237#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 244#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 225#L1469-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; 226#L1443-3 [2018-11-23 05:12:23,961 INFO L796 eck$LassoCheckResult]: Loop: 226#L1443-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; 233#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; 238#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; 239#L1445 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); 231#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 226#L1443-3 [2018-11-23 05:12:23,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:23,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2018-11-23 05:12:23,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:23,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:23,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:23,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:23,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:24,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:12:24,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:12:24,004 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:24,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2018-11-23 05:12:24,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:24,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:24,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:24,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:24,119 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 05:12:24,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:12:24,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:12:24,166 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-23 05:12:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:24,181 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-11-23 05:12:24,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:12:24,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2018-11-23 05:12:24,183 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:24,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2018-11-23 05:12:24,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:24,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:24,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-23 05:12:24,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:24,184 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-23 05:12:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-23 05:12:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 05:12:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 05:12:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-23 05:12:24,187 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 05:12:24,187 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 05:12:24,187 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:12:24,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-23 05:12:24,188 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:24,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:24,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:24,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:24,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:24,188 INFO L794 eck$LassoCheckResult]: Stem: 292#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); 286#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 287#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; 288#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 289#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 296#L1469-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); 297#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 298#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 277#L1469-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; 278#L1443-3 [2018-11-23 05:12:24,188 INFO L796 eck$LassoCheckResult]: Loop: 278#L1443-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; 285#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; 290#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; 291#L1445 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); 283#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 278#L1443-3 [2018-11-23 05:12:24,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2018-11-23 05:12:24,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:24,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:24,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:24,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/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-11-23 05:12:24,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:24,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:24,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:24,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 05:12:24,350 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:24,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2018-11-23 05:12:24,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:24,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:24,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:24,483 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 05:12:24,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:12:24,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:12:24,544 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-23 05:12:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:24,585 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 05:12:24,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:12:24,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2018-11-23 05:12:24,587 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:24,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2018-11-23 05:12:24,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:24,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:24,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-23 05:12:24,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:24,588 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-23 05:12:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-23 05:12:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 05:12:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 05:12:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-23 05:12:24,590 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-23 05:12:24,590 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-23 05:12:24,590 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 05:12:24,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-11-23 05:12:24,591 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:24,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:24,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:24,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:24,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:24,592 INFO L794 eck$LassoCheckResult]: Stem: 373#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); 367#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 368#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; 369#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 370#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 377#L1469-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); 378#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 379#L1469-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); 380#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 381#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 358#L1469-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; 359#L1443-3 [2018-11-23 05:12:24,592 INFO L796 eck$LassoCheckResult]: Loop: 359#L1443-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; 366#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; 371#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; 372#L1445 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); 364#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 359#L1443-3 [2018-11-23 05:12:24,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:24,592 INFO L82 PathProgramCache]: Analyzing trace with hash 447769425, now seen corresponding path program 2 times [2018-11-23 05:12:24,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:24,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:24,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:24,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:24,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:24,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:12:24,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:12:24,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:12:24,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:24,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:24,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:24,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 05:12:24,720 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:24,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2018-11-23 05:12:24,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:24,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:24,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:12:24,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:12:24,870 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-11-23 05:12:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:24,899 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 05:12:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:12:24,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-23 05:12:24,902 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:24,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 05:12:24,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:24,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:24,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-23 05:12:24,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:24,903 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 05:12:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-23 05:12:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 05:12:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 05:12:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 05:12:24,905 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 05:12:24,905 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 05:12:24,905 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 05:12:24,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-23 05:12:24,905 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:24,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:24,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:24,906 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:24,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:24,906 INFO L794 eck$LassoCheckResult]: Stem: 466#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); 460#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 461#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; 462#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 463#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 470#L1469-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); 471#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 472#L1469-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); 476#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 473#L1469-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); 474#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 475#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 451#L1469-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; 452#L1443-3 [2018-11-23 05:12:24,906 INFO L796 eck$LassoCheckResult]: Loop: 452#L1443-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; 459#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; 464#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; 465#L1445 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); 457#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 452#L1443-3 [2018-11-23 05:12:24,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:24,907 INFO L82 PathProgramCache]: Analyzing trace with hash 809744147, now seen corresponding path program 3 times [2018-11-23 05:12:24,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:24,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:24,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:24,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:24,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:24,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:12:24,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:12:24,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 05:12:24,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:24,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:25,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:25,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 05:12:25,047 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:25,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:25,047 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2018-11-23 05:12:25,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:25,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:25,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:25,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:25,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:12:25,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:12:25,197 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 9 Second operand 11 states. [2018-11-23 05:12:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:25,226 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 05:12:25,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:12:25,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-11-23 05:12:25,227 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:25,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 05:12:25,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:25,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:25,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2018-11-23 05:12:25,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:25,228 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 05:12:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2018-11-23 05:12:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 05:12:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 05:12:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 05:12:25,231 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 05:12:25,231 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 05:12:25,231 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 05:12:25,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-11-23 05:12:25,231 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:25,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:25,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:25,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:25,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:25,232 INFO L794 eck$LassoCheckResult]: Stem: 571#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); 565#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 566#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; 567#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 568#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 575#L1469-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); 578#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 579#L1469-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); 576#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 577#L1469-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); 583#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 582#L1469-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); 581#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 580#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 556#L1469-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; 557#L1443-3 [2018-11-23 05:12:25,232 INFO L796 eck$LassoCheckResult]: Loop: 557#L1443-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; 564#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; 569#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; 570#L1445 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); 562#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 557#L1443-3 [2018-11-23 05:12:25,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 4 times [2018-11-23 05:12:25,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:25,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:25,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:25,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:25,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:25,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:12:25,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:12:25,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:12:25,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:25,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:25,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:25,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 05:12:25,405 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:25,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 5 times [2018-11-23 05:12:25,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:25,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:25,553 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 05:12:25,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 05:12:25,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:12:25,593 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-23 05:12:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:25,624 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 05:12:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:12:25,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2018-11-23 05:12:25,625 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:25,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 05:12:25,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:25,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:25,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2018-11-23 05:12:25,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:25,626 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 05:12:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2018-11-23 05:12:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 05:12:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 05:12:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 05:12:25,628 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 05:12:25,628 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 05:12:25,628 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 05:12:25,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2018-11-23 05:12:25,628 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:25,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:25,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:25,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:25,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:25,629 INFO L794 eck$LassoCheckResult]: Stem: 688#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); 682#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 683#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; 684#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 685#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 692#L1469-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); 695#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 696#L1469-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); 693#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 694#L1469-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); 702#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 701#L1469-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); 700#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 699#L1469-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); 698#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 697#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 673#L1469-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; 674#L1443-3 [2018-11-23 05:12:25,629 INFO L796 eck$LassoCheckResult]: Loop: 674#L1443-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; 681#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; 686#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; 687#L1445 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); 679#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 674#L1443-3 [2018-11-23 05:12:25,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1842787607, now seen corresponding path program 5 times [2018-11-23 05:12:25,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:25,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:25,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:25,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:12:25,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:12:25,819 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 05:12:25,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:25,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:25,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:25,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-23 05:12:25,915 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:25,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:25,916 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 6 times [2018-11-23 05:12:25,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:25,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:25,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:25,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 05:12:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-11-23 05:12:26,051 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 9 Second operand 15 states. [2018-11-23 05:12:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:26,085 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 05:12:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:12:26,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2018-11-23 05:12:26,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:26,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 38 transitions. [2018-11-23 05:12:26,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:26,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:26,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2018-11-23 05:12:26,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:26,089 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-23 05:12:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2018-11-23 05:12:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 05:12:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 05:12:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 05:12:26,091 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 05:12:26,091 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 05:12:26,092 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 05:12:26,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-11-23 05:12:26,092 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:26,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:26,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:26,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:26,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:26,093 INFO L794 eck$LassoCheckResult]: Stem: 817#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); 811#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 812#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; 813#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 814#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 821#L1469-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); 824#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 825#L1469-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); 822#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 823#L1469-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); 833#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 832#L1469-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); 831#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 830#L1469-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); 829#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 828#L1469-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); 827#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 826#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 802#L1469-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; 803#L1443-3 [2018-11-23 05:12:26,093 INFO L796 eck$LassoCheckResult]: Loop: 803#L1443-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; 810#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; 815#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; 816#L1445 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); 808#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 803#L1443-3 [2018-11-23 05:12:26,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1392420697, now seen corresponding path program 6 times [2018-11-23 05:12:26,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:26,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:26,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:26,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:26,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:12:26,172 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:12:26,236 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 05:12:26,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:26,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:26,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:26,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 05:12:26,323 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:26,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 7 times [2018-11-23 05:12:26,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:26,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:26,447 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 05:12:26,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 05:12:26,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:12:26,489 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 9 Second operand 17 states. [2018-11-23 05:12:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:26,539 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 05:12:26,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:12:26,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2018-11-23 05:12:26,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:26,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 40 transitions. [2018-11-23 05:12:26,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:26,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:26,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-11-23 05:12:26,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:26,542 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 05:12:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-11-23 05:12:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 05:12:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 05:12:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 05:12:26,544 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 05:12:26,544 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 05:12:26,544 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 05:12:26,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2018-11-23 05:12:26,545 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:26,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:26,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:26,546 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:26,546 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:26,546 INFO L794 eck$LassoCheckResult]: Stem: 958#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); 952#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 953#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; 954#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 955#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 962#L1469-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); 965#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 966#L1469-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); 963#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 964#L1469-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); 976#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 975#L1469-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); 974#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 973#L1469-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); 972#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 971#L1469-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); 970#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 969#L1469-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); 968#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 967#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 943#L1469-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; 944#L1443-3 [2018-11-23 05:12:26,546 INFO L796 eck$LassoCheckResult]: Loop: 944#L1443-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; 951#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; 956#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; 957#L1445 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); 949#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 944#L1443-3 [2018-11-23 05:12:26,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1913450213, now seen corresponding path program 7 times [2018-11-23 05:12:26,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:26,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:26,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:26,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:26,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:26,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:12:26,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:26,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:26,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:26,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-23 05:12:26,782 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:26,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 8 times [2018-11-23 05:12:26,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:26,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:26,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:26,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 05:12:26,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-11-23 05:12:26,927 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 9 Second operand 19 states. [2018-11-23 05:12:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:26,988 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 05:12:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:12:26,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-23 05:12:26,988 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:26,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 42 transitions. [2018-11-23 05:12:26,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:26,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:26,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2018-11-23 05:12:26,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:26,989 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-23 05:12:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2018-11-23 05:12:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 05:12:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 05:12:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 05:12:26,991 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 05:12:26,991 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 05:12:26,992 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 05:12:26,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-11-23 05:12:26,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:26,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:26,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:26,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:26,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:26,993 INFO L794 eck$LassoCheckResult]: Stem: 1111#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); 1105#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 1106#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; 1107#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1108#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1115#L1469-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); 1118#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1119#L1469-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); 1116#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1117#L1469-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); 1131#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1130#L1469-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); 1129#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1128#L1469-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); 1127#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1126#L1469-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); 1125#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1124#L1469-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); 1123#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1122#L1469-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); 1121#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1120#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1096#L1469-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; 1097#L1443-3 [2018-11-23 05:12:26,993 INFO L796 eck$LassoCheckResult]: Loop: 1097#L1443-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; 1104#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; 1109#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; 1110#L1445 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); 1102#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1097#L1443-3 [2018-11-23 05:12:26,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash -579595683, now seen corresponding path program 8 times [2018-11-23 05:12:26,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:26,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:26,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:26,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:27,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:27,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:12:27,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:12:27,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:12:27,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:27,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:27,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:27,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-23 05:12:27,191 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:27,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 9 times [2018-11-23 05:12:27,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:27,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:27,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:27,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 05:12:27,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-11-23 05:12:27,329 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 9 Second operand 21 states. [2018-11-23 05:12:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:27,374 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 05:12:27,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:12:27,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2018-11-23 05:12:27,376 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:27,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 05:12:27,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:27,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:27,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2018-11-23 05:12:27,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:27,377 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 05:12:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2018-11-23 05:12:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 05:12:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 05:12:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 05:12:27,379 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 05:12:27,379 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 05:12:27,379 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 05:12:27,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-11-23 05:12:27,380 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:27,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:27,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:27,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:27,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:27,381 INFO L794 eck$LassoCheckResult]: Stem: 1276#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); 1270#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 1271#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; 1272#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1273#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1280#L1469-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); 1283#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1284#L1469-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); 1281#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1282#L1469-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); 1298#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1297#L1469-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); 1296#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1295#L1469-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); 1294#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1293#L1469-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); 1292#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1291#L1469-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); 1290#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1289#L1469-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); 1288#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1287#L1469-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); 1286#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1285#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1261#L1469-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; 1262#L1443-3 [2018-11-23 05:12:27,381 INFO L796 eck$LassoCheckResult]: Loop: 1262#L1443-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; 1269#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; 1274#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; 1275#L1445 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); 1267#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1262#L1443-3 [2018-11-23 05:12:27,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1354353439, now seen corresponding path program 9 times [2018-11-23 05:12:27,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:27,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:27,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:27,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:12:27,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:12:27,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 05:12:27,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:27,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:27,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:27,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-23 05:12:27,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:27,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 10 times [2018-11-23 05:12:27,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:27,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:27,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 05:12:27,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-11-23 05:12:27,878 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 23 states. [2018-11-23 05:12:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:27,929 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 05:12:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 05:12:27,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2018-11-23 05:12:27,929 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:27,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 05:12:27,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:12:27,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:12:27,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-11-23 05:12:27,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:12:27,930 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 05:12:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-11-23 05:12:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 05:12:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 05:12:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-23 05:12:27,931 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 05:12:27,932 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 05:12:27,932 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 05:12:27,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2018-11-23 05:12:27,932 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 05:12:27,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:27,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:27,932 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:12:27,932 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:12:27,932 INFO L794 eck$LassoCheckResult]: Stem: 1455#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); 1449#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 1450#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; 1451#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1452#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1459#L1469-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); 1462#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1463#L1469-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); 1460#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1461#L1469-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); 1479#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1478#L1469-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); 1477#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1476#L1469-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); 1475#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1474#L1469-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); 1473#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1472#L1469-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); 1471#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1470#L1469-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); 1469#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1468#L1469-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); 1467#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1466#L1469-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); 1465#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1464#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1440#L1469-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; 1441#L1443-3 [2018-11-23 05:12:27,933 INFO L796 eck$LassoCheckResult]: Loop: 1441#L1443-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; 1448#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; 1453#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; 1454#L1445 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); 1446#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1441#L1443-3 [2018-11-23 05:12:27,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 10 times [2018-11-23 05:12:27,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:27,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:27,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:27,960 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 11 times [2018-11-23 05:12:27,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:27,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:27,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:27,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2018-11-23 05:12:27,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:27,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:27,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:28,151 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 05:13:42,731 WARN L180 SmtUtils]: Spent 1.24 m on a formula simplification. DAG size of input: 348 DAG size of output: 299 [2018-11-23 05:13:42,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:13:42,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:13:48,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:13:48,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:13:54,206 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:13:54,338 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:13:59,129 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:13:59,227 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:03,521 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:03,613 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:07,139 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:07,229 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:10,267 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:10,343 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:12,514 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:12,549 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:13,383 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:13,408 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:14,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-11-23 05:14:14,027 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 9 variables, input treesize:528, output treesize:386 [2018-11-23 05:14:14,707 WARN L180 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-11-23 05:14:14,709 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:14:14,710 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:14:14,710 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:14:14,710 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:14:14,710 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:14:14,710 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:14:14,710 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:14:14,710 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:14:14,710 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1_true-valid-memsafety_true-termination.i_Iteration13_Lasso [2018-11-23 05:14:14,710 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:14:14,710 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:14:14,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:14,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:15,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:15,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:15,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:15,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:14:15,360 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:14:15,360 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:14:15,360 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-11-23 05:14:15,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,363 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-11-23 05:14:15,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,365 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-11-23 05:14:15,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:14:15,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:14:15,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,367 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-11-23 05:14:15,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:14:15,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:14:15,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,370 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-11-23 05:14:15,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,372 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-11-23 05:14:15,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,373 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-11-23 05:14:15,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,375 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-11-23 05:14:15,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:14:15,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:14:15,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,378 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-11-23 05:14:15,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,380 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-11-23 05:14:15,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,382 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-11-23 05:14:15,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,384 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-11-23 05:14:15,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:14:15,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:14:15,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,387 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-11-23 05:14:15,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:14:15,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:14:15,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,390 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-11-23 05:14:15,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,392 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-11-23 05:14:15,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,394 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-11-23 05:14:15,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:14:15,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:14:15,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:14:15,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:14:15,395 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-11-23 05:14:15,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:14:15,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:14:15,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:14:15,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:14:15,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:14:15,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:14:15,414 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:14:15,432 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 05:14:15,433 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 05:14:15,433 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:14:15,434 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:14:15,434 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:14:15,434 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-11-23 05:14:15,471 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-23 05:14:15,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:15,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:15,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:15,536 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-11-23 05:14:15,536 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 05:14:15,554 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 59 states and 71 transitions. Complement of second has 6 states. [2018-11-23 05:14:15,555 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-11-23 05:14:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:14:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-23 05:14:15,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-23 05:14:15,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:14:15,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-23 05:14:15,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:14:15,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-23 05:14:15,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:14:15,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2018-11-23 05:14:15,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 05:14:15,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 47 states and 55 transitions. [2018-11-23 05:14:15,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:14:15,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 05:14:15,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2018-11-23 05:14:15,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:14:15,559 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-23 05:14:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2018-11-23 05:14:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-23 05:14:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 05:14:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-23 05:14:15,569 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 05:14:15,569 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 05:14:15,569 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 05:14:15,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2018-11-23 05:14:15,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 05:14:15,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:14:15,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:14:15,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:15,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:14:15,571 INFO L794 eck$LassoCheckResult]: Stem: 1701#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); 1693#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 1694#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; 1695#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1696#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1705#L1469-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); 1706#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1707#L1469-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); 1708#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1725#L1469-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); 1724#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1723#L1469-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); 1722#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1721#L1469-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); 1720#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1719#L1469-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); 1718#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1717#L1469-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); 1716#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1715#L1469-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); 1714#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1713#L1469-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); 1712#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1711#L1469-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); 1710#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1709#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1682#L1469-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; 1683#L1443-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1690#L1443-4 alloc_17_#res := 0; 1686#L1454 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;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; 1687#L1459-3 [2018-11-23 05:14:15,571 INFO L796 eck$LassoCheckResult]: Loop: 1687#L1459-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; 1704#L1459-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1687#L1459-3 [2018-11-23 05:14:15,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash 999709617, now seen corresponding path program 1 times [2018-11-23 05:14:15,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:15,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:15,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:15,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 05:14:15,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:14:15,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:14:15,612 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:14:15,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2018-11-23 05:14:15,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:15,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:15,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:14:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:14:15,642 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-23 05:14:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:15,662 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-23 05:14:15,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:14:15,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2018-11-23 05:14:15,664 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 05:14:15,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2018-11-23 05:14:15,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 05:14:15,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 05:14:15,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2018-11-23 05:14:15,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:14:15,665 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-23 05:14:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2018-11-23 05:14:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2018-11-23 05:14:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 05:14:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-23 05:14:15,667 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 05:14:15,667 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 05:14:15,667 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 05:14:15,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2018-11-23 05:14:15,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 05:14:15,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:14:15,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:14:15,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:15,669 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:14:15,669 INFO L794 eck$LassoCheckResult]: Stem: 1810#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); 1802#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 1803#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; 1804#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1805#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1814#L1469-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); 1815#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1816#L1469-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); 1817#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1834#L1469-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); 1833#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1832#L1469-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); 1831#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1830#L1469-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); 1829#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1828#L1469-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); 1827#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1826#L1469-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); 1825#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1824#L1469-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); 1823#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1822#L1469-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); 1821#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1820#L1469-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); 1819#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1818#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1791#L1469-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; 1792#L1443-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; 1800#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1806#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; 1807#L1445 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1793#L1445-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1794#L1450-3 [2018-11-23 05:14:15,669 INFO L796 eck$LassoCheckResult]: Loop: 1794#L1450-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); 1811#L1450-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1794#L1450-3 [2018-11-23 05:14:15,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:15,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1350299059, now seen corresponding path program 1 times [2018-11-23 05:14:15,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:15,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:15,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:15,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:15,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2018-11-23 05:14:15,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:15,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:15,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:15,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:15,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:15,706 INFO L82 PathProgramCache]: Analyzing trace with hash -557270321, now seen corresponding path program 1 times [2018-11-23 05:14:15,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:15,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:15,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:15,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 05:14:15,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:14:15,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:14:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:14:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:14:15,818 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 05:14:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:15,841 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-23 05:14:15,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:14:15,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 69 transitions. [2018-11-23 05:14:15,843 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 05:14:15,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 69 transitions. [2018-11-23 05:14:15,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-23 05:14:15,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 05:14:15,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 69 transitions. [2018-11-23 05:14:15,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:14:15,844 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-23 05:14:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 69 transitions. [2018-11-23 05:14:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2018-11-23 05:14:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 05:14:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-11-23 05:14:15,847 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-23 05:14:15,847 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-23 05:14:15,847 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 05:14:15,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2018-11-23 05:14:15,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 05:14:15,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:14:15,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:14:15,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:15,848 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:14:15,848 INFO L794 eck$LassoCheckResult]: Stem: 1926#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); 1918#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 1919#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; 1920#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1921#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1931#L1469-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); 1932#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1933#L1469-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); 1934#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1954#L1469-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); 1953#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1952#L1469-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); 1951#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1950#L1469-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); 1949#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1947#L1469-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); 1945#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1943#L1469-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); 1942#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1941#L1469-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); 1940#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1939#L1469-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); 1938#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1937#L1469-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); 1936#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1935#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1906#L1469-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; 1907#L1443-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; 1914#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1924#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; 1925#L1445 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); 1912#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1913#L1443-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1916#L1443-4 alloc_17_#res := 0; 1910#L1454 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;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; 1911#L1459-3 [2018-11-23 05:14:15,848 INFO L796 eck$LassoCheckResult]: Loop: 1911#L1459-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; 1930#L1459-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1911#L1459-3 [2018-11-23 05:14:15,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash -93871603, now seen corresponding path program 1 times [2018-11-23 05:14:15,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:15,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:15,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:15,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 05:14:15,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:14:15,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:14:15,886 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:14:15,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:15,887 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2018-11-23 05:14:15,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:15,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:14:15,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:14:15,912 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-23 05:14:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:15,931 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-23 05:14:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:14:15,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 75 transitions. [2018-11-23 05:14:15,933 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-23 05:14:15,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 73 transitions. [2018-11-23 05:14:15,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-23 05:14:15,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-23 05:14:15,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 73 transitions. [2018-11-23 05:14:15,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:14:15,934 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-11-23 05:14:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 73 transitions. [2018-11-23 05:14:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2018-11-23 05:14:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 05:14:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-23 05:14:15,936 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-23 05:14:15,937 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-23 05:14:15,937 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 05:14:15,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2018-11-23 05:14:15,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 05:14:15,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:14:15,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:14:15,942 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:15,942 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:14:15,942 INFO L794 eck$LassoCheckResult]: Stem: 2051#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); 2043#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 2044#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; 2045#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2046#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2056#L1469-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); 2057#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2058#L1469-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); 2059#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2076#L1469-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); 2075#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2074#L1469-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); 2073#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2072#L1469-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); 2071#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2070#L1469-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); 2069#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2068#L1469-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); 2067#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2066#L1469-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); 2065#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2064#L1469-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); 2063#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2062#L1469-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); 2061#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2060#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2031#L1469-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; 2032#L1443-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; 2039#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; 2049#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; 2050#L1445 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); 2037#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2038#L1443-3 assume !(alloc_17_~i~0 < alloc_17_~len); 2041#L1443-4 alloc_17_#res := 0; 2035#L1454 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;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; 2036#L1459-3 [2018-11-23 05:14:15,942 INFO L796 eck$LassoCheckResult]: Loop: 2036#L1459-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; 2055#L1459-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 2036#L1459-3 [2018-11-23 05:14:15,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:15,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1868878965, now seen corresponding path program 1 times [2018-11-23 05:14:15,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:15,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 05:14:16,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:16,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88d51d84-14de-48f7-aef4-ef599c384932/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:16,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:16,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 05:14:16,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:16,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 05:14:16,079 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:14:16,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 3 times [2018-11-23 05:14:16,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:16,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:16,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:14:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:14:16,107 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-23 05:14:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:16,153 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-23 05:14:16,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:14:16,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 82 transitions. [2018-11-23 05:14:16,155 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-23 05:14:16,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 82 transitions. [2018-11-23 05:14:16,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 05:14:16,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 05:14:16,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 82 transitions. [2018-11-23 05:14:16,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:14:16,156 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-11-23 05:14:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 82 transitions. [2018-11-23 05:14:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2018-11-23 05:14:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 05:14:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-23 05:14:16,158 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-23 05:14:16,158 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-23 05:14:16,158 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 05:14:16,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-11-23 05:14:16,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 05:14:16,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:14:16,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:14:16,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:14:16,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:14:16,160 INFO L794 eck$LassoCheckResult]: Stem: 2287#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); 2279#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 2280#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; 2281#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2282#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2292#L1469-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); 2293#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2294#L1469-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); 2297#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2315#L1469-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); 2314#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2313#L1469-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); 2312#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2311#L1469-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); 2310#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2309#L1469-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); 2308#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2307#L1469-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); 2306#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2305#L1469-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); 2304#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2303#L1469-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); 2302#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2301#L1469-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); 2299#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2298#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2266#L1469-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; 2267#L1443-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; 2275#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2319#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; 2318#L1445 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2268#L1445-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2269#L1450-3 assume !(alloc_17_~j~0 >= 0); 2290#L1450-4 alloc_17_#res := 3; 2270#L1454 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;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; 2271#L1459-3 [2018-11-23 05:14:16,160 INFO L796 eck$LassoCheckResult]: Loop: 2271#L1459-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; 2291#L1459-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 2271#L1459-3 [2018-11-23 05:14:16,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash -95512495, now seen corresponding path program 1 times [2018-11-23 05:14:16,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:16,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:16,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:16,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 4 times [2018-11-23 05:14:16,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:16,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:16,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:16,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:16,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1593191981, now seen corresponding path program 1 times [2018-11-23 05:14:16,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:16,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:16,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:16,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:16,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:15:58,413 WARN L180 SmtUtils]: Spent 1.70 m on a formula simplification. DAG size of input: 388 DAG size of output: 336 [2018-11-23 05:15:58,424 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:15:58,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:02,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:03,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:07,045 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:07,160 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:10,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:10,291 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:12,934 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:12,994 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:15,186 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:15,289 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:16,946 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:17,007 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:18,633 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:18,653 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:19,926 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:19,955 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:20,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:20,482 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 9 variables, input treesize:489, output treesize:365 [2018-11-23 05:16:21,197 WARN L180 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-11-23 05:16:21,199 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:16:21,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:16:21,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:16:21,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:16:21,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:16:21,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:16:21,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:16:21,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:16:21,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1_true-valid-memsafety_true-termination.i_Iteration18_Lasso [2018-11-23 05:16:21,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:16:21,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:16:21,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,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-11-23 05:16:21,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-11-23 05:16:21,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-11-23 05:16:21,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-11-23 05:16:21,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-11-23 05:16:21,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:16:21,919 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:16:21,919 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:16:21,920 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-11-23 05:16:21,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:16:21,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:16:21,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:16:21,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,922 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-11-23 05:16:21,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:16:21,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:16:21,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:16:21,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,923 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-11-23 05:16:21,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,926 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-11-23 05:16:21,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,928 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-11-23 05:16:21,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,930 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-11-23 05:16:21,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,933 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-11-23 05:16:21,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,938 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-11-23 05:16:21,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,940 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-11-23 05:16:21,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,943 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-11-23 05:16:21,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,946 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-11-23 05:16:21,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,946 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:16:21,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,947 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:16:21,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,949 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-11-23 05:16:21,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,951 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-11-23 05:16:21,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:16:21,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:16:21,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:16:21,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,953 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-11-23 05:16:21,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:16:21,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:16:21,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:16:21,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,955 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-11-23 05:16:21,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:16:21,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:16:21,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:16:21,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:16:21,956 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-11-23 05:16:21,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:16:21,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:16:21,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:16:21,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:16:21,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:16:21,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:16:21,970 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:16:21,982 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:16:21,982 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:16:21,982 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:16:21,983 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:16:21,983 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:16:21,983 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~len) = -1*ULTIMATE.start_free_17_~i~1 + 1*ULTIMATE.start_free_17_~len Supporting invariants [] [2018-11-23 05:16:22,106 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 05:16:22,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:22,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:22,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:16:22,188 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-11-23 05:16:22,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 62 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 05:16:22,204 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 62 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 56 states and 65 transitions. Complement of second has 4 states. [2018-11-23 05:16:22,205 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-11-23 05:16:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:16:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 05:16:22,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 2 letters. [2018-11-23 05:16:22,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:16:22,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 37 letters. Loop has 2 letters. [2018-11-23 05:16:22,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:16:22,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 4 letters. [2018-11-23 05:16:22,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:16:22,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 65 transitions. [2018-11-23 05:16:22,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:16:22,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 44 states and 48 transitions. [2018-11-23 05:16:22,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 05:16:22,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 05:16:22,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions. [2018-11-23 05:16:22,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:16:22,208 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 05:16:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions. [2018-11-23 05:16:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-11-23 05:16:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 05:16:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-23 05:16:22,209 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-23 05:16:22,210 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-23 05:16:22,210 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 05:16:22,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2018-11-23 05:16:22,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:16:22,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:16:22,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:16:22,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:22,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:16:22,211 INFO L794 eck$LassoCheckResult]: Stem: 2551#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); 2543#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;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; 2544#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; 2545#L1076 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2546#L1468 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2553#L1469-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); 2554#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2555#L1469-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); 2556#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2573#L1469-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); 2572#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2571#L1469-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); 2570#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2569#L1469-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); 2568#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2567#L1469-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); 2566#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2565#L1469-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); 2564#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2563#L1469-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); 2562#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2561#L1469-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); 2560#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2559#L1469-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); 2558#L1469-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2557#L1469-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2535#L1469-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; 2536#L1443-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; 2541#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; 2549#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; 2550#L1445 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); 2539#L1443-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2540#L1443-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; 2542#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2547#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; 2548#L1445 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2537#L1445-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2538#L1450-3 [2018-11-23 05:16:22,211 INFO L796 eck$LassoCheckResult]: Loop: 2538#L1450-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); 2552#L1450-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2538#L1450-3 [2018-11-23 05:16:22,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash -694922329, now seen corresponding path program 1 times [2018-11-23 05:16:22,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:16:22,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:16:22,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:22,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:22,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:16:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:16:22,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 2 times [2018-11-23 05:16:22,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:16:22,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:16:22,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:22,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:22,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:16:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:16:22,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:22,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2100425303, now seen corresponding path program 1 times [2018-11-23 05:16:22,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:16:22,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:16:22,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:22,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:16:22,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:16:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:41,062 WARN L180 SmtUtils]: Spent 2.31 m on a formula simplification. DAG size of input: 431 DAG size of output: 370 [2018-11-23 05:18:41,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:18:41,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:18:47,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:18:47,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:18:53,936 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:18:54,053 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:00,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:00,324 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:05,190 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:05,278 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:09,560 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:09,632 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:12,591 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:12,670 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:15,140 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:15,184 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:17,353 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:17,392 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:19,036 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:19,069 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:19,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 10 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-11-23 05:19:19,820 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 11 variables, input treesize:806, output treesize:726 [2018-11-23 05:19:20,530 WARN L180 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-11-23 05:19:20,533 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:19:20,533 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:19:20,533 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:19:20,533 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:19:20,533 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:19:20,533 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:19:20,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:19:20,533 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:19:20,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1_true-valid-memsafety_true-termination.i_Iteration19_Lasso [2018-11-23 05:19:20,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:19:20,533 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:19:20,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:20,942 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-11-23 05:19:21,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:21,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:21,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:21,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:21,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:21,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:19:21,315 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:19:21,315 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:19:21,315 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-11-23 05:19:21,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,317 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-11-23 05:19:21,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,321 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-11-23 05:19:21,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,322 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-11-23 05:19:21,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,328 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-11-23 05:19:21,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,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-11-23 05:19:21,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,348 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-11-23 05:19:21,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,350 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-11-23 05:19:21,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,353 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-11-23 05:19:21,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,356 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-11-23 05:19:21,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,358 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-11-23 05:19:21,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,360 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-11-23 05:19:21,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,360 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:19:21,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,361 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:19:21,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,365 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-11-23 05:19:21,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,367 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-11-23 05:19:21,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,372 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-11-23 05:19:21,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:19:21,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:19:21,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:19:21,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,374 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-11-23 05:19:21,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,375 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:19:21,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,376 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:19:21,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,379 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-11-23 05:19:21,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,379 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:19:21,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,380 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:19:21,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,382 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-11-23 05:19:21,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,385 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-11-23 05:19:21,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,388 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-11-23 05:19:21,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,391 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-11-23 05:19:21,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,394 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-11-23 05:19:21,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:19:21,397 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-11-23 05:19:21,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:19:21,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:19:21,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:19:21,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:19:21,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:19:21,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:19:21,408 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:19:21,413 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 05:19:21,413 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 05:19:21,413 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:19:21,414 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 05:19:21,414 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:19:21,414 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0, ULTIMATE.start_entry_point_~i~2) = 20*ULTIMATE.start_alloc_17_~j~0 + 1*ULTIMATE.start_entry_point_~i~2 Supporting invariants [1*ULTIMATE.start_entry_point_~i~2 - 10 >= 0] [2018-11-23 05:19:21,604 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2018-11-23 05:19:21,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:19:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:19:21,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:19:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:19:21,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:19:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:19:21,781 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2018-11-23 05:19:21,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand 14 states. [2018-11-23 05:19:21,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6. Second operand 14 states. Result 42 states and 46 transitions. Complement of second has 15 states. [2018-11-23 05:19:21,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 12 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:19:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 05:19:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2018-11-23 05:19:21,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 37 letters. Loop has 2 letters. [2018-11-23 05:19:21,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:19:21,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 39 letters. Loop has 2 letters. [2018-11-23 05:19:21,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:19:21,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 37 letters. Loop has 4 letters. [2018-11-23 05:19:21,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:19:21,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 46 transitions. [2018-11-23 05:19:21,951 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:19:21,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-11-23 05:19:21,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 05:19:21,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 05:19:21,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 05:19:21,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:19:21,952 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:19:21,952 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:19:21,952 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:19:21,952 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 05:19:21,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:19:21,953 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:19:21,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 05:19:21,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:19:21 BoogieIcfgContainer [2018-11-23 05:19:21,958 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:19:21,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:19:21,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:19:21,959 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:19:21,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:12:22" (3/4) ... [2018-11-23 05:19:21,962 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:19:21,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:19:21,963 INFO L168 Benchmark]: Toolchain (without parser) took 420617.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 250.1 MB). Free memory was 956.4 MB in the beginning and 816.2 MB in the end (delta: 140.3 MB). Peak memory consumption was 390.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:21,963 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:19:21,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:21,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:21,965 INFO L168 Benchmark]: Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:19:21,965 INFO L168 Benchmark]: RCFGBuilder took 261.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:21,965 INFO L168 Benchmark]: BuchiAutomizer took 419768.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 816.2 MB in the end (delta: 275.9 MB). Peak memory consumption was 374.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:21,966 INFO L168 Benchmark]: Witness Printer took 3.33 ms. Allocated memory is still 1.3 GB. Free memory is still 816.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:19:21,969 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 261.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 419768.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 816.2 MB in the end (delta: 275.9 MB). Peak memory consumption was 374.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.33 ms. Allocated memory is still 1.3 GB. Free memory is still 816.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (15 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[array] + -1 * 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 -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function 20 * j + i and consists of 14 locations. 15 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 419.7s and 20 iterations. TraceHistogramMax:10. Analysis of lassos took 418.2s. Construction of modules took 0.4s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 102 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 17. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 436 SDtfs, 638 SDslu, 1189 SDs, 0 SdLazy, 627 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU14 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital487 mio100 ax107 hnf100 lsp88 ukn37 mio100 lsp52 div100 bol100 ite100 ukn100 eq182 hnf89 smp96 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...