./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a1e56cd09ec23c2fd76dcb47b6d93a02131ca6ec ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:11,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:11,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:11,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:11,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:11,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:11,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:11,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:11,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:11,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:11,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:11,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:11,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:11,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:11,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:11,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:11,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:11,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:11,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:11,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:11,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:11,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:11,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:11,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:11,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:11,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:11,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:11,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:11,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:11,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:11,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:11,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:11,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:11,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:11,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:11,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:11,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:11,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:11,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:11,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:11,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:11,865 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:11,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:11,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:11,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:11,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:11,877 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:11,877 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:11,878 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:11,878 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:11,878 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:11,878 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:11,878 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:11,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:11,879 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:11,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:11,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:11,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:11,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:11,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:11,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:11,880 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:11,880 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:11,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:11,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:11,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:11,880 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:11,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:11,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:11,881 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:11,882 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:11,882 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1e56cd09ec23c2fd76dcb47b6d93a02131ca6ec [2019-10-22 08:54:11,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:11,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:11,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:11,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:11,923 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:11,924 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i [2019-10-22 08:54:11,971 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/data/d99d508f7/5d3508639ddc4640ac935c8c41afe21c/FLAG400b89165 [2019-10-22 08:54:12,376 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:12,376 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i [2019-10-22 08:54:12,387 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/data/d99d508f7/5d3508639ddc4640ac935c8c41afe21c/FLAG400b89165 [2019-10-22 08:54:12,399 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/data/d99d508f7/5d3508639ddc4640ac935c8c41afe21c [2019-10-22 08:54:12,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:12,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:12,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:12,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:12,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc74767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,418 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:12,449 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:12,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,765 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:12,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,847 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:12,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12 WrapperNode [2019-10-22 08:54:12,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:12,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:12,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:12,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:12,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:12,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:12,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:12,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:13,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:13,499 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:13,499 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-10-22 08:54:13,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:13 BoogieIcfgContainer [2019-10-22 08:54:13,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:13,501 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:13,501 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:13,505 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:13,506 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:13,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:12" (1/3) ... [2019-10-22 08:54:13,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d910fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:13, skipping insertion in model container [2019-10-22 08:54:13,507 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:13,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (2/3) ... [2019-10-22 08:54:13,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d910fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:13, skipping insertion in model container [2019-10-22 08:54:13,508 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:13,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:13" (3/3) ... [2019-10-22 08:54:13,510 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-1.i [2019-10-22 08:54:13,553 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:13,554 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:13,554 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:13,554 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:13,555 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:13,556 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:13,556 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:13,556 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:13,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-10-22 08:54:13,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 08:54:13,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,600 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,600 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:13,600 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:13,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-10-22 08:54:13,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 08:54:13,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,603 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,603 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:13,610 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 3#L588true assume !(main_~length1~0 < 1); 6#L588-2true assume !(main_~length2~0 < 1); 15#L591-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 27#L573true assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 18#L551-4true [2019-10-22 08:54:13,611 INFO L793 eck$LassoCheckResult]: Loop: 18#L551-4true call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 29#L551-1true assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 14#L551-3true cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 18#L551-4true [2019-10-22 08:54:13,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2019-10-22 08:54:13,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30355475] [2019-10-22 08:54:13,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,776 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,778 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2019-10-22 08:54:13,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124427879] [2019-10-22 08:54:13,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,794 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2019-10-22 08:54:13,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345419763] [2019-10-22 08:54:13,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,844 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:14,415 WARN L191 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-10-22 08:54:14,589 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-10-22 08:54:14,605 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:14,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:14,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:14,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:14,607 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:14,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:14,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:14,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:14,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration1_Lasso [2019-10-22 08:54:14,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:14,608 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:14,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,112 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-10-22 08:54:15,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,038 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:54:16,155 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:16,160 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:16,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,171 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,172 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,174 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,174 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,175 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,175 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,180 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,181 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,186 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,186 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,191 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,191 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,192 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,194 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,194 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,195 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,197 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,198 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,198 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,202 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,203 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,208 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,209 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,209 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,212 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,215 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,216 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,216 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,219 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,219 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,223 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,225 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,225 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,230 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,232 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,233 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,246 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,246 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:54:16,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,248 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:16,248 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,256 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:16,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,263 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:16,264 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,338 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,339 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,339 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,351 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,352 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,440 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:16,496 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:54:16,498 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:54:16,500 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:16,501 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:16,502 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:16,504 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrlen_~s~0.base)_1, ULTIMATE.start_cstrlen_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrlen_~s~0.base)_1 - 1*ULTIMATE.start_cstrlen_~s~0.offset Supporting invariants [] [2019-10-22 08:54:16,548 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 08:54:16,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:16,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:16,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:16,640 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 [2019-10-22 08:54:16,642 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2019-10-22 08:54:16,706 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 83 states and 114 transitions. Complement of second has 5 states. [2019-10-22 08:54:16,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2019-10-22 08:54:16,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:54:16,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:16,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:54:16,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:16,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 6 letters. Loop has 6 letters. [2019-10-22 08:54:16,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:16,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 114 transitions. [2019-10-22 08:54:16,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 08:54:16,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 27 states and 36 transitions. [2019-10-22 08:54:16,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-10-22 08:54:16,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 08:54:16,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-10-22 08:54:16,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:16,721 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-22 08:54:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-10-22 08:54:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 08:54:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:54:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-10-22 08:54:16,746 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-22 08:54:16,746 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-22 08:54:16,746 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:16,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2019-10-22 08:54:16,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 08:54:16,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:16,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:16,748 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:16,748 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:16,748 INFO L791 eck$LassoCheckResult]: Stem: 251#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 225#L588 assume !(main_~length1~0 < 1); 226#L588-2 assume !(main_~length2~0 < 1); 231#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 242#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 244#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 246#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 247#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 248#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 250#L575-4 [2019-10-22 08:54:16,748 INFO L793 eck$LassoCheckResult]: Loop: 250#L575-4 goto; 233#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 227#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 228#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 249#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 240#L558 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 229#L566 cstrstr_#t~ret16 := cstrncmp_#res; 230#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 250#L575-4 [2019-10-22 08:54:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2019-10-22 08:54:16,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707699807] [2019-10-22 08:54:16,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,776 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2019-10-22 08:54:16,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884290451] [2019-10-22 08:54:16,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:16,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884290451] [2019-10-22 08:54:16,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:16,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:16,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59479073] [2019-10-22 08:54:16,816 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:16,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:16,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:16,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:16,819 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 08:54:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:16,847 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-10-22 08:54:16,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:16,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2019-10-22 08:54:16,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-10-22 08:54:16,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2019-10-22 08:54:16,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-10-22 08:54:16,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-10-22 08:54:16,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2019-10-22 08:54:16,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:16,850 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-22 08:54:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2019-10-22 08:54:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-22 08:54:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 08:54:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-22 08:54:16,852 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-22 08:54:16,853 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-22 08:54:16,853 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:16,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2019-10-22 08:54:16,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-10-22 08:54:16,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:16,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:16,854 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:16,854 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:16,854 INFO L791 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 311#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 302#L588 assume !(main_~length1~0 < 1); 303#L588-2 assume !(main_~length2~0 < 1); 292#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 293#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 297#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 299#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 300#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 301#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 312#L575-4 [2019-10-22 08:54:16,854 INFO L793 eck$LassoCheckResult]: Loop: 312#L575-4 goto; 310#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 305#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 306#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 309#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 294#L558 assume !(0 == cstrncmp_~n % 4294967296); 295#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 304#L561 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 307#L566 cstrstr_#t~ret16 := cstrncmp_#res; 308#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 312#L575-4 [2019-10-22 08:54:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2019-10-22 08:54:16,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011775199] [2019-10-22 08:54:16,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,878 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:16,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,879 INFO L82 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2019-10-22 08:54:16,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384424519] [2019-10-22 08:54:16,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,899 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:16,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2019-10-22 08:54:16,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39961597] [2019-10-22 08:54:16,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:16,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39961597] [2019-10-22 08:54:16,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:16,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:16,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107462176] [2019-10-22 08:54:17,226 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-10-22 08:54:17,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:17,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:17,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:17,288 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-10-22 08:54:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:17,376 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-10-22 08:54:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:17,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2019-10-22 08:54:17,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-10-22 08:54:17,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2019-10-22 08:54:17,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-10-22 08:54:17,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 08:54:17,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2019-10-22 08:54:17,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:17,379 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-10-22 08:54:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2019-10-22 08:54:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-10-22 08:54:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:54:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-10-22 08:54:17,381 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-22 08:54:17,381 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-22 08:54:17,381 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:17,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2019-10-22 08:54:17,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-10-22 08:54:17,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:17,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:17,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:17,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:17,383 INFO L791 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 383#L588 assume !(main_~length1~0 < 1); 384#L588-2 assume !(main_~length2~0 < 1); 372#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 373#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 377#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 379#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 381#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 382#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 398#L575-4 goto; 390#L576-2 [2019-10-22 08:54:17,383 INFO L793 eck$LassoCheckResult]: Loop: 390#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 386#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 387#L576 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 390#L576-2 [2019-10-22 08:54:17,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2019-10-22 08:54:17,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482389020] [2019-10-22 08:54:17,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,403 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2019-10-22 08:54:17,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071546548] [2019-10-22 08:54:17,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,409 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2019-10-22 08:54:17,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606152465] [2019-10-22 08:54:17,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,445 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,964 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 130 [2019-10-22 08:54:18,329 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2019-10-22 08:54:18,335 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:18,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:18,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:18,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:18,335 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:18,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:18,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:18,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:18,336 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration4_Lasso [2019-10-22 08:54:18,336 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:18,336 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:18,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,739 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-10-22 08:54:18,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:18,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:19,431 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:54:19,536 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:19,536 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:19,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,537 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,538 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,538 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,542 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,543 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,545 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,545 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,545 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,545 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,546 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,546 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,547 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,548 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,548 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,548 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,550 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,551 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,551 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,553 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,554 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,556 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,556 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,556 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,556 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,557 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,557 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,558 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,559 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,559 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,560 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,560 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,561 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,562 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,562 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,566 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,568 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,568 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,570 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,571 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,574 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,576 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,576 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,578 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,578 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,578 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,579 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,579 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:19,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,582 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:19,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:19,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,585 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,585 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,591 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,594 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,595 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:54:19,595 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-10-22 08:54:19,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,606 INFO L400 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2019-10-22 08:54:19,606 INFO L401 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-10-22 08:54:19,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,658 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:19,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,662 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:19,662 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,685 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,685 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,688 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,688 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:19,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:19,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:19,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:19,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:19,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:19,692 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:19,692 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:19,706 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:19,721 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:19,729 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:54:19,730 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:19,730 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:19,730 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:19,731 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrstr_~s.offset, v_rep(select #length ULTIMATE.start_cstrstr_~s.base)_1) = -1*ULTIMATE.start_cstrstr_~s.offset + 1*v_rep(select #length ULTIMATE.start_cstrstr_~s.base)_1 Supporting invariants [] [2019-10-22 08:54:19,833 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2019-10-22 08:54:19,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:19,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:19,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:19,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:19,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:54:19,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:19,901 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 [2019-10-22 08:54:19,901 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:54:19,926 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 50 states and 58 transitions. Complement of second has 4 states. [2019-10-22 08:54:19,927 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 [2019-10-22 08:54:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2019-10-22 08:54:19,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:54:19,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:19,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:54:19,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:19,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2019-10-22 08:54:19,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:19,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2019-10-22 08:54:19,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:19,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2019-10-22 08:54:19,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 08:54:19,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:54:19,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-10-22 08:54:19,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:19,931 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-22 08:54:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-10-22 08:54:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 08:54:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 08:54:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-10-22 08:54:19,937 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-22 08:54:19,937 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-22 08:54:19,937 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:19,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-10-22 08:54:19,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:19,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:19,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:19,939 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:19,939 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:19,939 INFO L791 eck$LassoCheckResult]: Stem: 637#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 630#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 620#L588 assume !(main_~length1~0 < 1); 621#L588-2 assume !(main_~length2~0 < 1); 611#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 612#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 613#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 614#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 603#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 604#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 615#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 616#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 617#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 631#L575-4 goto; 632#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 622#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 624#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 627#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 605#L558 assume !(0 == cstrncmp_~n % 4294967296); 606#L560-4 [2019-10-22 08:54:19,939 INFO L793 eck$LassoCheckResult]: Loop: 606#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 618#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 633#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 634#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 609#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 606#L560-4 [2019-10-22 08:54:19,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,939 INFO L82 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2019-10-22 08:54:19,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:19,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315630147] [2019-10-22 08:54:19,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,980 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:19,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,985 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2019-10-22 08:54:19,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:19,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276587015] [2019-10-22 08:54:19,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,997 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,004 INFO L82 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2019-10-22 08:54:20,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:20,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628903162] [2019-10-22 08:54:20,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:20,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628903162] [2019-10-22 08:54:20,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772559415] [2019-10-22 08:54:20,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f81cd756-f90e-4bb5-aa08-5ea6444c6cc1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:20,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 08:54:20,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:20,249 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:20,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-10-22 08:54:20,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493310704] [2019-10-22 08:54:20,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:54:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:54:20,376 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 11 states. [2019-10-22 08:54:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:20,491 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-10-22 08:54:20,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:20,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2019-10-22 08:54:20,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:20,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2019-10-22 08:54:20,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:54:20,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:54:20,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2019-10-22 08:54:20,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:20,503 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-22 08:54:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2019-10-22 08:54:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-22 08:54:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:54:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-22 08:54:20,512 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-22 08:54:20,512 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-22 08:54:20,512 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:20,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2019-10-22 08:54:20,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:20,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:20,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:20,513 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:20,513 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:20,514 INFO L791 eck$LassoCheckResult]: Stem: 835#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 832#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 822#L588 assume !(main_~length1~0 < 1); 823#L588-2 assume !(main_~length2~0 < 1); 811#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 812#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 815#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 816#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 805#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 806#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 817#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 842#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 843#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 841#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 818#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 819#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 833#L575-4 goto; 834#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 824#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 825#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 829#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 807#L558 assume !(0 == cstrncmp_~n % 4294967296); 808#L560-4 [2019-10-22 08:54:20,514 INFO L793 eck$LassoCheckResult]: Loop: 808#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 820#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 836#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 837#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 813#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 808#L560-4 [2019-10-22 08:54:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2019-10-22 08:54:20,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:20,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018030681] [2019-10-22 08:54:20,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,556 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:20,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2019-10-22 08:54:20,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:20,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721849716] [2019-10-22 08:54:20,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,572 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2019-10-22 08:54:20,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:20,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960252111] [2019-10-22 08:54:20,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,627 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:20,735 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-10-22 08:54:21,544 WARN L191 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-10-22 08:54:22,099 WARN L191 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 145 [2019-10-22 08:54:22,101 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:22,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:22,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:22,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:22,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:22,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:22,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:22,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:22,102 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration6_Lasso [2019-10-22 08:54:22,102 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:22,102 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:22,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,864 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 136 [2019-10-22 08:54:23,067 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-10-22 08:54:23,375 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-22 08:54:23,476 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-22 08:54:24,091 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-22 08:54:24,237 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-22 08:54:24,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:24,384 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:24,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,388 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,388 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,390 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,392 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,393 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,393 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,393 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,393 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,395 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,396 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,396 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,396 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,397 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,399 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,400 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,400 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,402 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,402 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,403 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,403 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,405 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,405 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,406 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,407 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,407 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,409 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,409 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,410 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,410 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,413 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,414 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,414 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,415 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,416 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,416 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,418 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,418 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,420 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,422 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,422 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,423 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,424 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,424 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,425 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,426 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,427 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,428 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,428 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,430 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,431 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,432 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,434 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,434 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,435 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,435 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,435 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,435 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,436 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,436 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,438 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,440 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,441 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,441 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,442 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,443 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,443 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,444 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,444 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,446 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,446 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,446 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,448 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,448 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,448 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,450 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,450 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,450 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,451 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,451 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,452 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,452 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,453 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,453 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,454 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,454 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,454 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,454 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,456 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,458 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,458 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,461 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,461 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,465 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:54:24,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,465 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:24,466 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,468 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:24,468 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,471 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:24,472 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,494 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,494 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,496 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,496 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,496 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,498 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,498 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,498 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,498 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,503 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,503 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,620 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:24,758 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:54:24,758 INFO L444 ModelExtractionUtils]: 79 out of 85 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:54:24,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:24,759 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:24,760 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:24,760 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_1, ULTIMATE.start_cstrncmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_1 - 1*ULTIMATE.start_cstrncmp_~s2.offset Supporting invariants [] [2019-10-22 08:54:24,992 INFO L297 tatePredicateManager]: 52 out of 53 supporting invariants were superfluous and have been removed [2019-10-22 08:54:24,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:25,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:25,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-22 08:54:25,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:25,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:54:25,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:25,128 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2019-10-22 08:54:25,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-10-22 08:54:25,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 63 states and 74 transitions. Complement of second has 7 states. [2019-10-22 08:54:25,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 0 non-accepting loop states 2 accepting loop states [2019-10-22 08:54:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2019-10-22 08:54:25,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 22 letters. Loop has 5 letters. [2019-10-22 08:54:25,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:25,224 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:25,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-22 08:54:25,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:25,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:54:25,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:25,361 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2019-10-22 08:54:25,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-10-22 08:54:25,468 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 95 states and 110 transitions. Complement of second has 13 states. [2019-10-22 08:54:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 2 accepting loop states [2019-10-22 08:54:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-10-22 08:54:25,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 22 letters. Loop has 5 letters. [2019-10-22 08:54:25,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:25,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 27 letters. Loop has 5 letters. [2019-10-22 08:54:25,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:25,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 22 letters. Loop has 10 letters. [2019-10-22 08:54:25,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:25,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 110 transitions. [2019-10-22 08:54:25,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:25,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 70 states and 82 transitions. [2019-10-22 08:54:25,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:54:25,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-10-22 08:54:25,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 82 transitions. [2019-10-22 08:54:25,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:25,478 INFO L688 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-10-22 08:54:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 82 transitions. [2019-10-22 08:54:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2019-10-22 08:54:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 08:54:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-10-22 08:54:25,481 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-10-22 08:54:25,481 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-10-22 08:54:25,481 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:54:25,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2019-10-22 08:54:25,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:25,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:25,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:25,482 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:25,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:25,483 INFO L791 eck$LassoCheckResult]: Stem: 1481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1473#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1463#L588 assume !(main_~length1~0 < 1); 1464#L588-2 assume !(main_~length2~0 < 1); 1453#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1454#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1455#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1456#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1485#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1457#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1458#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1445#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1446#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1484#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1459#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1460#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1474#L575-4 goto; 1475#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1476#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1493#L576 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 1472#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1465#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1466#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1470#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1451#L558 assume !(0 == cstrncmp_~n % 4294967296); 1448#L560-4 [2019-10-22 08:54:25,483 INFO L793 eck$LassoCheckResult]: Loop: 1448#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1461#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 1477#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 1478#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1447#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1448#L560-4 [2019-10-22 08:54:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1711753785, now seen corresponding path program 1 times [2019-10-22 08:54:25,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:25,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464855039] [2019-10-22 08:54:25,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,508 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2019-10-22 08:54:25,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:25,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341513078] [2019-10-22 08:54:25,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,516 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash -234967533, now seen corresponding path program 1 times [2019-10-22 08:54:25,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:25,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362384850] [2019-10-22 08:54:25,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,577 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:25,708 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-22 08:54:26,572 WARN L191 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 210 [2019-10-22 08:54:27,176 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 156 [2019-10-22 08:54:27,178 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:27,179 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:27,179 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:27,179 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:27,179 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:27,179 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:27,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:27,179 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:27,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration7_Lasso [2019-10-22 08:54:27,179 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:27,179 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:27,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,062 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 146 [2019-10-22 08:54:28,315 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-10-22 08:54:28,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:28,637 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-10-22 08:54:28,806 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-10-22 08:54:29,078 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-10-22 08:54:29,581 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-22 08:54:29,831 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-10-22 08:54:29,864 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:29,864 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:29,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,866 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,866 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,868 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,868 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,869 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,869 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,870 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,871 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,871 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,871 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,873 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,874 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,875 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:29,875 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:29,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,879 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,880 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,883 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,883 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,884 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,886 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,886 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,886 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,886 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,888 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,889 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:29,892 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:29,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,893 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,894 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,894 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,898 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,898 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:29,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:29,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:29,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,903 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:29,903 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:29,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,907 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:54:29,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,907 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:29,908 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:29,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:29,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:29,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:29,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:29,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:29,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:29,915 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:29,915 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:30,031 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:30,082 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:30,082 INFO L444 ModelExtractionUtils]: 80 out of 85 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:54:30,083 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:30,083 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:30,083 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:30,084 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_2, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_2 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2019-10-22 08:54:30,467 INFO L297 tatePredicateManager]: 78 out of 78 supporting invariants were superfluous and have been removed [2019-10-22 08:54:30,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:30,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:30,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:30,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:30,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:54:30,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:30,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:54:30,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-10-22 08:54:30,566 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 57 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 102 states and 121 transitions. Complement of second has 7 states. [2019-10-22 08:54:30,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2019-10-22 08:54:30,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 25 letters. Loop has 5 letters. [2019-10-22 08:54:30,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:30,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 30 letters. Loop has 5 letters. [2019-10-22 08:54:30,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:30,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 25 letters. Loop has 10 letters. [2019-10-22 08:54:30,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:30,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 121 transitions. [2019-10-22 08:54:30,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:30,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 77 states and 91 transitions. [2019-10-22 08:54:30,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 08:54:30,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:54:30,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 91 transitions. [2019-10-22 08:54:30,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:30,577 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 91 transitions. [2019-10-22 08:54:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 91 transitions. [2019-10-22 08:54:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2019-10-22 08:54:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-22 08:54:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-10-22 08:54:30,582 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-10-22 08:54:30,582 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-10-22 08:54:30,582 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:54:30,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2019-10-22 08:54:30,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:30,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:30,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:30,583 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:30,583 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:30,583 INFO L791 eck$LassoCheckResult]: Stem: 2061#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2053#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 2042#L588 assume !(main_~length1~0 < 1); 2043#L588-2 assume !(main_~length2~0 < 1); 2032#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 2033#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 2034#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2035#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2023#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 2024#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2036#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2066#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 2069#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2065#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2037#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 2038#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 2054#L575-4 goto; 2055#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 2044#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 2045#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 2071#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 2073#L558 assume !(0 == cstrncmp_~n % 4294967296); 2072#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 2041#L561 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 2046#L566 cstrstr_#t~ret16 := cstrncmp_#res; 2047#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 2062#L575-4 goto; 2052#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 2070#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 2048#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 2049#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 2025#L558 assume !(0 == cstrncmp_~n % 4294967296); 2026#L560-4 [2019-10-22 08:54:30,584 INFO L793 eck$LassoCheckResult]: Loop: 2026#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 2039#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 2057#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 2058#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 2029#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 2026#L560-4 [2019-10-22 08:54:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2019-10-22 08:54:30,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:30,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865350910] [2019-10-22 08:54:30,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:30,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:30,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:30,647 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 4 times [2019-10-22 08:54:30,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:30,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360812773] [2019-10-22 08:54:30,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:30,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:30,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:30,655 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2019-10-22 08:54:30,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:30,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515519445] [2019-10-22 08:54:30,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:30,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:30,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:30,699 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:30,806 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-10-22 08:54:32,097 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 328 DAG size of output: 258 [2019-10-22 08:54:32,738 WARN L191 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 161 [2019-10-22 08:54:32,740 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:32,740 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:32,740 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:32,740 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:32,740 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:32,740 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:32,740 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:32,740 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:32,740 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration8_Lasso [2019-10-22 08:54:32,740 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:32,740 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:32,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:33,769 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 151 [2019-10-22 08:54:34,076 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 103 [2019-10-22 08:54:34,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:34,466 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-10-22 08:54:34,660 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-10-22 08:54:35,160 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-22 08:54:35,805 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-22 08:54:35,860 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:35,860 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:35,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,862 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,862 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,863 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,864 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,866 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,867 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,867 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,871 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,871 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,874 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,874 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,877 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,879 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,883 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,883 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:35,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,884 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:35,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:35,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,886 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,886 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,887 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,889 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,889 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,892 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,896 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,896 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,898 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:35,898 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:35,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,903 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-10-22 08:54:35,903 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:54:35,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,934 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,934 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,936 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,936 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,936 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,941 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,941 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,942 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,942 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:54:35,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,943 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,943 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:35,943 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:35,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:35,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:35,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:35,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:35,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:35,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:35,949 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:35,950 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:36,047 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:36,157 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:54:36,157 INFO L444 ModelExtractionUtils]: 73 out of 79 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:54:36,158 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:36,158 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:36,159 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:36,159 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_3, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_3 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2019-10-22 08:54:36,677 INFO L297 tatePredicateManager]: 102 out of 102 supporting invariants were superfluous and have been removed [2019-10-22 08:54:36,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:36,750 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:54:36,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-10-22 08:54:36,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 80 states and 94 transitions. Complement of second has 7 states. [2019-10-22 08:54:36,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2019-10-22 08:54:36,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 32 letters. Loop has 5 letters. [2019-10-22 08:54:36,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,774 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:36,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:36,853 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:54:36,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-10-22 08:54:36,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 79 states and 93 transitions. Complement of second has 7 states. [2019-10-22 08:54:36,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-10-22 08:54:36,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2019-10-22 08:54:36,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,883 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:54:36,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:36,967 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:54:36,967 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-10-22 08:54:36,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 82 states and 96 transitions. Complement of second has 6 states. [2019-10-22 08:54:36,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-10-22 08:54:36,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 32 letters. Loop has 5 letters. [2019-10-22 08:54:36,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 37 letters. Loop has 5 letters. [2019-10-22 08:54:36,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 32 letters. Loop has 10 letters. [2019-10-22 08:54:36,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:36,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 96 transitions. [2019-10-22 08:54:36,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:36,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 0 states and 0 transitions. [2019-10-22 08:54:36,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:36,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:36,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:36,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:36,995 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:36,995 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:36,995 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:36,995 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:54:36,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:36,996 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:36,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:37,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:37 BoogieIcfgContainer [2019-10-22 08:54:37,002 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:37,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:37,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:37,002 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:37,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:13" (3/4) ... [2019-10-22 08:54:37,006 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:37,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:37,008 INFO L168 Benchmark]: Toolchain (without parser) took 24605.14 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 633.9 MB). Free memory was 943.2 MB in the beginning and 1.2 GB in the end (delta: -301.9 MB). Peak memory consumption was 332.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:37,008 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:37,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:37,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:37,009 INFO L168 Benchmark]: Boogie Preprocessor took 53.08 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:37,010 INFO L168 Benchmark]: RCFGBuilder took 544.78 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: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:37,010 INFO L168 Benchmark]: BuchiAutomizer took 23500.79 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 486.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.5 MB). Peak memory consumption was 336.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:37,010 INFO L168 Benchmark]: Witness Printer took 4.39 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:37,012 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 445.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.83 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. * Boogie Preprocessor took 53.08 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 544.78 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: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23500.79 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 486.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.5 MB). Peak memory consumption was 336.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.39 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s2 and consists of 9 locations. One deterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s1 and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s1 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.4s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 21.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 7. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 325 SDtfs, 368 SDslu, 554 SDs, 0 SdLazy, 235 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital313 mio100 ax106 hnf99 lsp91 ukn91 mio100 lsp43 div144 bol100 ite100 ukn100 eq171 hnf75 smp96 dnf224 smp89 tf100 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 62ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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...