./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strstr.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/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strstr.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/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 938c367f37ddd298c829be75f27a69a6e9a1154b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:17:41,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:17:41,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:17:41,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:17:41,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:17:41,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:17:41,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:17:41,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:17:41,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:17:41,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:17:41,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:17:41,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:17:41,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:17:41,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:17:41,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:17:41,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:17:41,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:17:41,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:17:41,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:17:41,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:17:41,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:17:41,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:17:41,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:17:41,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:17:41,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:17:41,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:17:41,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:17:41,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:17:41,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:17:41,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:17:41,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:17:41,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:17:41,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:17:41,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:17:41,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:17:41,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:17:41,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:17:41,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:17:41,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:17:41,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:17:41,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:17:41,865 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:17:41,893 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:17:41,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:17:41,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:17:41,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:17:41,895 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:17:41,895 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:17:41,895 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:17:41,895 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:17:41,895 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:17:41,896 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:17:41,896 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:17:41,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:17:41,896 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:17:41,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:17:41,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:17:41,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:17:41,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:17:41,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:17:41,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:17:41,897 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:17:41,898 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:17:41,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:17:41,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:17:41,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:17:41,898 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:17:41,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:17:41,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:17:41,899 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:17:41,900 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:17:41,900 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/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 -> 938c367f37ddd298c829be75f27a69a6e9a1154b [2019-11-16 00:17:41,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:17:41,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:17:41,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:17:41,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:17:41,939 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:17:41,940 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strstr.i [2019-11-16 00:17:41,994 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/data/02e93ea1e/ed098152d2e045f48921da6e91418ba3/FLAGc4446b01a [2019-11-16 00:17:42,455 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:17:42,456 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/sv-benchmarks/c/termination-libowfat/strstr.i [2019-11-16 00:17:42,469 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/data/02e93ea1e/ed098152d2e045f48921da6e91418ba3/FLAGc4446b01a [2019-11-16 00:17:42,729 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/data/02e93ea1e/ed098152d2e045f48921da6e91418ba3 [2019-11-16 00:17:42,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:17:42,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:17:42,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:17:42,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:17:42,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:17:42,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:42" (1/1) ... [2019-11-16 00:17:42,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bae02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:42, skipping insertion in model container [2019-11-16 00:17:42,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:42" (1/1) ... [2019-11-16 00:17:42,749 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:17:42,785 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:17:43,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:17:43,184 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:17:43,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:17:43,280 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:17:43,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43 WrapperNode [2019-11-16 00:17:43,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:17:43,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:17:43,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:17:43,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:17:43,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... [2019-11-16 00:17:43,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... [2019-11-16 00:17:43,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:17:43,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:17:43,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:17:43,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:17:43,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... [2019-11-16 00:17:43,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... [2019-11-16 00:17:43,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... [2019-11-16 00:17:43,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... [2019-11-16 00:17:43,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... [2019-11-16 00:17:43,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... [2019-11-16 00:17:43,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... [2019-11-16 00:17:43,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:17:43,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:17:43,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:17:43,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:17:43,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:17:43,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:17:43,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:17:43,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:17:43,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:17:43,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:17:43,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:17:43,877 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:17:43,877 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-16 00:17:43,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:43 BoogieIcfgContainer [2019-11-16 00:17:43,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:17:43,879 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:17:43,879 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:17:43,882 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:17:43,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:17:43,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:17:42" (1/3) ... [2019-11-16 00:17:43,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cb42b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:17:43, skipping insertion in model container [2019-11-16 00:17:43,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:17:43,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:43" (2/3) ... [2019-11-16 00:17:43,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cb42b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:17:43, skipping insertion in model container [2019-11-16 00:17:43,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:17:43,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:43" (3/3) ... [2019-11-16 00:17:43,887 INFO L371 chiAutomizerObserver]: Analyzing ICFG strstr.i [2019-11-16 00:17:43,933 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:17:43,933 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:17:43,933 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:17:43,933 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:17:43,933 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:17:43,933 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:17:43,934 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:17:43,934 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:17:43,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-16 00:17:43,972 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-16 00:17:43,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:43,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:43,979 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:17:43,979 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:17:43,980 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:17:43,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-16 00:17:43,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-16 00:17:43,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:43,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:43,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:17:43,984 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:17:43,991 INFO L791 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 14#L541true assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 25#L545true assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 19#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 23#L509-4true [2019-11-16 00:17:43,992 INFO L793 eck$LassoCheckResult]: Loop: 23#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 29#L509-1true assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 34#L509-3true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 23#L509-4true [2019-11-16 00:17:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-11-16 00:17:44,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:44,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467016913] [2019-11-16 00:17:44,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:44,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:44,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:44,163 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2019-11-16 00:17:44,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:44,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050456851] [2019-11-16 00:17:44,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:44,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:44,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:44,180 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:44,182 INFO L82 PathProgramCache]: Analyzing trace with hash 179566670, now seen corresponding path program 1 times [2019-11-16 00:17:44,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:44,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743705857] [2019-11-16 00:17:44,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:44,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:44,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:44,246 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:44,835 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2019-11-16 00:17:45,057 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-16 00:17:45,070 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:17:45,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:17:45,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:17:45,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:17:45,072 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:17:45,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:17:45,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:17:45,072 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:17:45,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2019-11-16 00:17:45,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:17:45,073 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:17:45,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-11-16 00:17:45,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-11-16 00:17:45,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-11-16 00:17:45,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-11-16 00:17:45,518 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-16 00:17:45,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:45,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:46,491 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:17:46,614 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:17:46,619 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:17:46,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:46,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:46,623 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:46,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:46,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:46,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:46,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:46,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:46,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:46,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:46,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:46,630 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:46,631 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:46,631 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:46,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:46,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:46,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:46,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:46,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:46,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:46,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:46,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:46,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:46,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:46,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:46,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:46,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:46,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:46,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:46,637 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:46,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:46,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:46,643 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:46,644 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:46,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:46,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:46,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:46,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:46,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:46,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:46,664 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:46,664 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:46,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:46,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:46,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:46,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:46,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:46,682 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:17:46,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:46,683 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:17:46,683 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:46,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:46,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:46,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:46,688 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:17:46,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:46,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:46,700 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:17:46,708 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:46,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:46,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:46,822 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:46,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:46,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:46,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:46,824 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:46,826 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:46,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:46,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:46,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:46,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:46,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:46,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:46,844 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:46,844 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:46,907 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:17:46,964 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:17:46,964 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:17:46,966 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:17:46,968 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:17:46,968 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:17:46,969 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2019-11-16 00:17:47,003 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-16 00:17:47,012 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:17:47,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:47,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:47,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:47,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:47,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:47,138 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-11-16 00:17:47,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-11-16 00:17:47,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 90 states and 130 transitions. Complement of second has 6 states. [2019-11-16 00:17:47,219 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-11-16 00:17:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:17:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2019-11-16 00:17:47,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-16 00:17:47,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:47,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-16 00:17:47,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:47,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-16 00:17:47,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:47,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2019-11-16 00:17:47,250 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2019-11-16 00:17:47,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 47 states and 62 transitions. [2019-11-16 00:17:47,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-11-16 00:17:47,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-16 00:17:47,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 62 transitions. [2019-11-16 00:17:47,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:47,261 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-16 00:17:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 62 transitions. [2019-11-16 00:17:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-16 00:17:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-16 00:17:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-16 00:17:47,295 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-16 00:17:47,295 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-16 00:17:47,296 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:17:47,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2019-11-16 00:17:47,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2019-11-16 00:17:47,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:47,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:47,299 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:47,299 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:17:47,300 INFO L791 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 219#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 220#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 227#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 232#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 234#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 246#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 223#L509-10 [2019-11-16 00:17:47,300 INFO L793 eck$LassoCheckResult]: Loop: 223#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 224#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 240#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 223#L509-10 [2019-11-16 00:17:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1806906284, now seen corresponding path program 1 times [2019-11-16 00:17:47,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:47,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809647239] [2019-11-16 00:17:47,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:47,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809647239] [2019-11-16 00:17:47,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:47,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:47,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776469554] [2019-11-16 00:17:47,400 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:17:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash 72652, now seen corresponding path program 1 times [2019-11-16 00:17:47,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:47,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78880622] [2019-11-16 00:17:47,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:47,423 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:47,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:47,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:47,463 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-11-16 00:17:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:47,488 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-11-16 00:17:47,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:47,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-11-16 00:17:47,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-16 00:17:47,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2019-11-16 00:17:47,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-16 00:17:47,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:17:47,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-16 00:17:47,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:47,492 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-16 00:17:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-16 00:17:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-16 00:17:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-16 00:17:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-16 00:17:47,494 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-16 00:17:47,494 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-16 00:17:47,495 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:17:47,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-11-16 00:17:47,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-16 00:17:47,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:47,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:47,498 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:47,498 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:17:47,499 INFO L791 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 296#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 304#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 311#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 312#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 314#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 316#L509-5 strlen_#res := strlen_~i~0; 301#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 302#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 298#L509-10 [2019-11-16 00:17:47,499 INFO L793 eck$LassoCheckResult]: Loop: 298#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 303#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 297#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 298#L509-10 [2019-11-16 00:17:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash 764823385, now seen corresponding path program 1 times [2019-11-16 00:17:47,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:47,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410401415] [2019-11-16 00:17:47,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:47,554 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:47,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:47,557 INFO L82 PathProgramCache]: Analyzing trace with hash 72652, now seen corresponding path program 2 times [2019-11-16 00:17:47,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:47,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809284124] [2019-11-16 00:17:47,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:47,570 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:47,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:47,571 INFO L82 PathProgramCache]: Analyzing trace with hash 52000116, now seen corresponding path program 1 times [2019-11-16 00:17:47,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:47,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885410077] [2019-11-16 00:17:47,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:47,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:48,261 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 118 [2019-11-16 00:17:48,428 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-16 00:17:48,429 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:17:48,430 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:17:48,430 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:17:48,430 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:17:48,430 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:17:48,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:17:48,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:17:48,430 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:17:48,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration3_Lasso [2019-11-16 00:17:48,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:17:48,430 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:17:48,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,718 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-16 00:17:48,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,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-11-16 00:17:48,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:48,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:49,595 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:17:49,649 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:17:49,649 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:17:49,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:49,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:49,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:49,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:49,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:49,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:49,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:49,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:49,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:49,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:49,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:49,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:49,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,660 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:49,660 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:49,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,662 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,662 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:49,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,663 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:49,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:49,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:49,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:49,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:49,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:49,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:49,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,671 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:49,671 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:49,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,674 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,675 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:49,675 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:49,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:49,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:49,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:49,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:49,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:49,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:49,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:49,682 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:49,709 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:17:49,724 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:17:49,725 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:17:49,725 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:17:49,726 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:17:49,727 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:17:49,727 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s.base)_2, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_2 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2019-11-16 00:17:49,762 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-11-16 00:17:49,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:17:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:49,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:49,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:49,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:49,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:49,819 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-11-16 00:17:49,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:17:49,854 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 57 states and 72 transitions. Complement of second has 4 states. [2019-11-16 00:17:49,856 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-11-16 00:17:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:17:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2019-11-16 00:17:49,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-16 00:17:49,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:49,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-16 00:17:49,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:49,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:17:49,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:49,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. [2019-11-16 00:17:49,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-16 00:17:49,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 43 states and 54 transitions. [2019-11-16 00:17:49,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-16 00:17:49,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-16 00:17:49,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-11-16 00:17:49,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:49,860 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-16 00:17:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-11-16 00:17:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-11-16 00:17:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:17:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-11-16 00:17:49,863 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-16 00:17:49,863 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-16 00:17:49,863 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:17:49,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2019-11-16 00:17:49,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:17:49,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:49,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:49,865 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:49,865 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:17:49,865 INFO L791 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 490#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 491#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 501#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 506#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 507#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 509#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 511#L509-5 strlen_#res := strlen_~i~0; 494#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 495#L508-2 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 499#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 500#L529 assume !(0 == strstr_~nl~0 % 4294967296); 504#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 505#L531-3 [2019-11-16 00:17:49,865 INFO L793 eck$LassoCheckResult]: Loop: 505#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 488#L532 assume !strstr_#t~short17; 489#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 503#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 505#L531-3 [2019-11-16 00:17:49,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash 51953446, now seen corresponding path program 1 times [2019-11-16 00:17:49,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:49,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418592444] [2019-11-16 00:17:49,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:49,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:49,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:49,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-11-16 00:17:49,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418592444] [2019-11-16 00:17:49,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:49,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:49,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489433038] [2019-11-16 00:17:49,902 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:17:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 1 times [2019-11-16 00:17:49,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:49,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267882126] [2019-11-16 00:17:49,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:49,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:49,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:49,913 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:50,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:50,033 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-16 00:17:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:50,084 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2019-11-16 00:17:50,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:17:50,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-16 00:17:50,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:17:50,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2019-11-16 00:17:50,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:17:50,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-16 00:17:50,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-11-16 00:17:50,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:50,086 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-16 00:17:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-11-16 00:17:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-16 00:17:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:17:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-16 00:17:50,088 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-16 00:17:50,088 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-16 00:17:50,089 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:17:50,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-11-16 00:17:50,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:17:50,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:50,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:50,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:50,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:17:50,090 INFO L791 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 560#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 561#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 571#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 578#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 579#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 581#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 583#L509-5 strlen_#res := strlen_~i~0; 566#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 567#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 568#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 570#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 574#L509-11 strlen_#res := strlen_~i~0; 572#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 573#L529 assume !(0 == strstr_~nl~0 % 4294967296); 575#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 576#L531-3 [2019-11-16 00:17:50,090 INFO L793 eck$LassoCheckResult]: Loop: 576#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 564#L532 assume !strstr_#t~short17; 565#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 577#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 576#L531-3 [2019-11-16 00:17:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1349410205, now seen corresponding path program 1 times [2019-11-16 00:17:50,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:50,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305640205] [2019-11-16 00:17:50,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:50,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305640205] [2019-11-16 00:17:50,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:50,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:50,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488712023] [2019-11-16 00:17:50,158 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:17:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:50,158 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 2 times [2019-11-16 00:17:50,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:50,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351666100] [2019-11-16 00:17:50,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,171 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:50,295 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-16 00:17:50,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:50,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:50,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:50,344 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-16 00:17:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:50,408 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-11-16 00:17:50,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:50,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 74 transitions. [2019-11-16 00:17:50,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-16 00:17:50,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 47 states and 56 transitions. [2019-11-16 00:17:50,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-16 00:17:50,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-16 00:17:50,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 56 transitions. [2019-11-16 00:17:50,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:50,412 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-11-16 00:17:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 56 transitions. [2019-11-16 00:17:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-11-16 00:17:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:17:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-16 00:17:50,415 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-16 00:17:50,415 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-16 00:17:50,415 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:17:50,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-11-16 00:17:50,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:17:50,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:50,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:50,417 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-11-16 00:17:50,417 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:17:50,417 INFO L791 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 671#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 672#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 682#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 687#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 688#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 689#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 694#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 690#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 691#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 692#L509-5 strlen_#res := strlen_~i~0; 675#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 676#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 677#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 679#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 683#L509-11 strlen_#res := strlen_~i~0; 680#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 681#L529 assume !(0 == strstr_~nl~0 % 4294967296); 684#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 685#L531-3 [2019-11-16 00:17:50,417 INFO L793 eck$LassoCheckResult]: Loop: 685#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 669#L532 assume !strstr_#t~short17; 670#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 686#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 685#L531-3 [2019-11-16 00:17:50,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1796108770, now seen corresponding path program 1 times [2019-11-16 00:17:50,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:50,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652366649] [2019-11-16 00:17:50,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:17:50,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652366649] [2019-11-16 00:17:50,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:50,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:50,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364175610] [2019-11-16 00:17:50,476 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:17:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:50,477 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 3 times [2019-11-16 00:17:50,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:50,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425677311] [2019-11-16 00:17:50,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,485 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:50,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:50,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:50,596 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-16 00:17:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:50,646 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-11-16 00:17:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:17:50,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2019-11-16 00:17:50,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:17:50,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 38 transitions. [2019-11-16 00:17:50,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:17:50,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-16 00:17:50,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2019-11-16 00:17:50,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:50,649 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-16 00:17:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2019-11-16 00:17:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-16 00:17:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:17:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-16 00:17:50,651 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-16 00:17:50,651 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-16 00:17:50,651 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:17:50,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2019-11-16 00:17:50,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-16 00:17:50,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:50,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:50,652 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:50,653 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:17:50,653 INFO L791 eck$LassoCheckResult]: Stem: 777#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 753#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 754#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 764#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 771#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 772#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 773#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 778#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 774#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 775#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 776#L509-5 strlen_#res := strlen_~i~0; 759#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 760#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 761#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 762#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 755#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 756#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 763#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 767#L509-11 strlen_#res := strlen_~i~0; 765#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 766#L529 assume !(0 == strstr_~nl~0 % 4294967296); 768#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 769#L531-3 [2019-11-16 00:17:50,653 INFO L793 eck$LassoCheckResult]: Loop: 769#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 757#L532 assume !strstr_#t~short17; 758#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 770#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 769#L531-3 [2019-11-16 00:17:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1624521053, now seen corresponding path program 1 times [2019-11-16 00:17:50,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:50,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393662192] [2019-11-16 00:17:50,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,688 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 4 times [2019-11-16 00:17:50,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:50,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093407621] [2019-11-16 00:17:50,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,697 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:50,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:50,697 INFO L82 PathProgramCache]: Analyzing trace with hash 16049535, now seen corresponding path program 1 times [2019-11-16 00:17:50,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:50,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007804027] [2019-11-16 00:17:50,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:50,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:50,733 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:51,658 WARN L191 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 162 [2019-11-16 00:17:51,835 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-16 00:17:51,838 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:17:51,839 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:17:51,839 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:17:51,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:17:51,839 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:17:51,839 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:17:51,839 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:17:51,839 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:17:51,839 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2019-11-16 00:17:51,839 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:17:51,839 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:17:51,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:51,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:52,547 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-11-16 00:17:52,684 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-16 00:17:52,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-11-16 00:17:52,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:52,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:52,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:52,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:52,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:52,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-11-16 00:17:53,000 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-16 00:17:53,476 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:17:53,637 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:17:53,637 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:17:53,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,641 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,641 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,641 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,645 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,647 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,647 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,649 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,654 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,654 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,659 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,679 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,679 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,682 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,682 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,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-11-16 00:17:53,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,687 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:53,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:53,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:53,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,691 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,694 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,694 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,697 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,697 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,703 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,703 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,705 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,705 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,711 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,714 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,714 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,717 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,717 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,719 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:17:53,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,720 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,724 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:17:53,724 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,748 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,748 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,750 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:17:53,750 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:17:53,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,753 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-16 00:17:53,753 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:17:53,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:53,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:53,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:53,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:53,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:53,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:53,772 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:53,772 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:53,819 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:17:53,880 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-16 00:17:53,880 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:17:53,881 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:17:53,881 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:17:53,882 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:17:53,882 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strstr_~haystack.base)_1, ULTIMATE.start_strstr_~haystack.offset) = 1*v_rep(select #length ULTIMATE.start_strstr_~haystack.base)_1 - 1*ULTIMATE.start_strstr_~haystack.offset Supporting invariants [] [2019-11-16 00:17:54,006 INFO L297 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2019-11-16 00:17:54,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:17:54,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:54,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:54,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:54,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:54,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:54,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:17:54,122 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-16 00:17:54,146 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-11-16 00:17:54,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:17:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:17:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2019-11-16 00:17:54,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 22 letters. Loop has 4 letters. [2019-11-16 00:17:54,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:54,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 26 letters. Loop has 4 letters. [2019-11-16 00:17:54,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:54,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 22 letters. Loop has 8 letters. [2019-11-16 00:17:54,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:54,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-11-16 00:17:54,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:17:54,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 45 transitions. [2019-11-16 00:17:54,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-16 00:17:54,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-16 00:17:54,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2019-11-16 00:17:54,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:54,152 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-16 00:17:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2019-11-16 00:17:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-11-16 00:17:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-16 00:17:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-11-16 00:17:54,155 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-11-16 00:17:54,155 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-11-16 00:17:54,155 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:17:54,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2019-11-16 00:17:54,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:17:54,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:54,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:54,158 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:54,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:17:54,159 INFO L791 eck$LassoCheckResult]: Stem: 1079#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1057#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 1058#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 1066#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1073#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1074#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1075#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1080#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1076#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1077#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1078#L509-5 strlen_#res := strlen_~i~0; 1061#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1062#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1063#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1064#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1059#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1060#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1065#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1070#L509-11 strlen_#res := strlen_~i~0; 1067#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1068#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1071#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1072#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1054#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1051#L517-3 [2019-11-16 00:17:54,166 INFO L793 eck$LassoCheckResult]: Loop: 1051#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1046#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1047#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 1051#L517-3 [2019-11-16 00:17:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2091601114, now seen corresponding path program 1 times [2019-11-16 00:17:54,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:54,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067581697] [2019-11-16 00:17:54,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:54,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:54,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:54,221 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 1 times [2019-11-16 00:17:54,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:54,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061331987] [2019-11-16 00:17:54,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:54,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:54,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:54,234 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:54,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:54,236 INFO L82 PathProgramCache]: Analyzing trace with hash 496824785, now seen corresponding path program 1 times [2019-11-16 00:17:54,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:54,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363579190] [2019-11-16 00:17:54,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:54,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:54,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:54,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:55,737 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 269 DAG size of output: 198 [2019-11-16 00:17:56,039 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-11-16 00:17:56,058 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:17:56,058 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:17:56,058 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:17:56,058 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:17:56,058 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:17:56,058 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:17:56,058 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:17:56,059 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:17:56,059 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration8_Lasso [2019-11-16 00:17:56,059 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:17:56,059 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:17:56,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,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-11-16 00:17:56,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:56,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-11-16 00:17:56,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-11-16 00:17:56,983 WARN L191 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 124 [2019-11-16 00:17:57,217 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-16 00:17:57,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:57,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:57,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:57,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:17:57,745 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-16 00:17:58,547 WARN L191 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-11-16 00:17:58,816 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-16 00:17:58,879 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:17:58,879 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:17:58,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-11-16 00:17:58,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,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-11-16 00:17:58,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,888 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,890 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,891 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,893 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,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-11-16 00:17:58,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,898 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,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-11-16 00:17:58,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,903 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,906 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:58,906 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:58,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,910 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,912 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,912 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,915 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,916 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,920 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,920 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,921 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,921 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,923 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,927 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:58,928 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:58,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,930 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,930 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,931 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:58,932 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:58,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,933 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:58,934 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:58,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:58,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-11-16 00:17:58,936 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:58,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:58,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:58,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:58,938 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:58,939 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,013 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,014 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,014 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,018 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,022 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,023 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,023 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,023 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,030 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,030 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,031 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,031 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,033 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,033 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,035 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,036 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,036 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,047 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,047 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,049 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:17:59,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,050 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:17:59,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:17:59,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,052 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:17:59,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,057 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:17:59,057 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,091 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:59,091 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,094 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:59,094 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,100 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:59,100 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,103 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:17:59,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,105 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:17:59,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,116 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:59,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,121 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:59,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,127 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:59,127 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,130 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:59,130 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,134 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:59,134 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:17:59,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:17:59,140 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:17:59,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:17:59,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:17:59,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:17:59,146 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:17:59,146 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:17:59,273 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:17:59,362 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:17:59,362 INFO L444 ModelExtractionUtils]: 67 out of 73 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:17:59,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:17:59,363 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:17:59,364 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:17:59,364 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~s~0.offset, v_rep(select #length ULTIMATE.start_memcmp_~s~0.base)_1) = -1*ULTIMATE.start_memcmp_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_memcmp_~s~0.base)_1 Supporting invariants [] [2019-11-16 00:17:59,635 INFO L297 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2019-11-16 00:17:59,636 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:17:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:59,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:59,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:59,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:59,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:59,731 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-11-16 00:17:59,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-16 00:17:59,762 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 84 states and 102 transitions. Complement of second has 7 states. [2019-11-16 00:17:59,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:17:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:17:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2019-11-16 00:17:59,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-16 00:17:59,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:59,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 27 letters. Loop has 3 letters. [2019-11-16 00:17:59,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:59,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 24 letters. Loop has 6 letters. [2019-11-16 00:17:59,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:17:59,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 102 transitions. [2019-11-16 00:17:59,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:17:59,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 74 transitions. [2019-11-16 00:17:59,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-16 00:17:59,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:17:59,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 74 transitions. [2019-11-16 00:17:59,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:59,771 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-11-16 00:17:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 74 transitions. [2019-11-16 00:17:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2019-11-16 00:17:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-16 00:17:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-11-16 00:17:59,782 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-11-16 00:17:59,782 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-11-16 00:17:59,782 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:17:59,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2019-11-16 00:17:59,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:17:59,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:59,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:59,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:59,785 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:17:59,786 INFO L791 eck$LassoCheckResult]: Stem: 1488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1465#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 1466#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 1474#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1482#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1483#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1484#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1489#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1485#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1486#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1487#L509-5 strlen_#res := strlen_~i~0; 1469#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1470#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1471#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1472#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1467#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1468#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1473#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1479#L509-11 strlen_#res := strlen_~i~0; 1475#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1476#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1480#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1481#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1462#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1464#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1494#L517-1 assume !(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6; 1459#L517-4 memcmp_#res := 0; 1460#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 1477#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 1478#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1491#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1461#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1456#L517-3 [2019-11-16 00:17:59,786 INFO L793 eck$LassoCheckResult]: Loop: 1456#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1452#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1453#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 1456#L517-3 [2019-11-16 00:17:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1259680368, now seen corresponding path program 1 times [2019-11-16 00:17:59,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:59,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721968647] [2019-11-16 00:17:59,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:59,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:59,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:17:59,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721968647] [2019-11-16 00:17:59,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:59,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:59,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336796963] [2019-11-16 00:17:59,820 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:17:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 2 times [2019-11-16 00:17:59,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:59,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139094360] [2019-11-16 00:17:59,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:59,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:59,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:59,833 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:59,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:59,961 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-16 00:17:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:59,986 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-11-16 00:17:59,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:17:59,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2019-11-16 00:17:59,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:17:59,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 52 transitions. [2019-11-16 00:17:59,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-16 00:17:59,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-16 00:17:59,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 52 transitions. [2019-11-16 00:17:59,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:17:59,989 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-11-16 00:17:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 52 transitions. [2019-11-16 00:17:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-16 00:17:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-16 00:17:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-11-16 00:17:59,992 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-11-16 00:17:59,992 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-11-16 00:17:59,992 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:17:59,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2019-11-16 00:17:59,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:17:59,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:17:59,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:17:59,994 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:59,994 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:17:59,994 INFO L791 eck$LassoCheckResult]: Stem: 1590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1566#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 1567#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 1575#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1582#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1583#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1584#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1591#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1585#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1586#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1587#L509-5 strlen_#res := strlen_~i~0; 1570#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1571#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1572#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1573#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1568#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1569#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1574#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1579#L509-11 strlen_#res := strlen_~i~0; 1576#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1577#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1580#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1581#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1563#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1565#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1557#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1558#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 1588#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 1589#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 1595#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1594#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1562#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1559#L517-3 [2019-11-16 00:17:59,994 INFO L793 eck$LassoCheckResult]: Loop: 1559#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1555#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1556#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 1559#L517-3 [2019-11-16 00:17:59,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:59,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1432054472, now seen corresponding path program 1 times [2019-11-16 00:17:59,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:59,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967783248] [2019-11-16 00:17:59,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:59,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:59,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:00,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967783248] [2019-11-16 00:18:00,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154332737] [2019-11-16 00:18:00,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:00,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-16 00:18:00,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:00,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:00,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2019-11-16 00:18:00,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:18:00,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:00,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:18:00,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:3 [2019-11-16 00:18:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:18:00,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:18:00,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-11-16 00:18:00,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574942445] [2019-11-16 00:18:00,544 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:18:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:00,544 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 3 times [2019-11-16 00:18:00,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:00,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59659831] [2019-11-16 00:18:00,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:00,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:00,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:00,565 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:18:00,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:00,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:18:00,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:18:00,671 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-16 00:18:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:00,829 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-11-16 00:18:00,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:18:00,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 64 transitions. [2019-11-16 00:18:00,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:18:00,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 62 transitions. [2019-11-16 00:18:00,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:18:00,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-16 00:18:00,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 62 transitions. [2019-11-16 00:18:00,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:18:00,833 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-11-16 00:18:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 62 transitions. [2019-11-16 00:18:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-16 00:18:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-16 00:18:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-11-16 00:18:00,836 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-11-16 00:18:00,836 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-11-16 00:18:00,836 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:18:00,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2019-11-16 00:18:00,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:18:00,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:18:00,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:18:00,838 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:00,838 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:18:00,838 INFO L791 eck$LassoCheckResult]: Stem: 1808#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1780#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 1781#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 1793#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1800#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1801#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1802#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1809#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1803#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1804#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1805#L509-5 strlen_#res := strlen_~i~0; 1788#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1789#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1790#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1791#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1782#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1783#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1792#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1796#L509-11 strlen_#res := strlen_~i~0; 1794#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1795#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1797#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1798#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1785#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1787#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1821#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1822#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 1820#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1819#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1814#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 1806#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 1807#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 1816#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1815#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1784#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1778#L517-3 [2019-11-16 00:18:00,838 INFO L793 eck$LassoCheckResult]: Loop: 1778#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1774#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1775#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 1778#L517-3 [2019-11-16 00:18:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash 428144867, now seen corresponding path program 1 times [2019-11-16 00:18:00,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:00,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455766505] [2019-11-16 00:18:00,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:00,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:00,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:18:00,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455766505] [2019-11-16 00:18:00,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139531852] [2019-11-16 00:18:00,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:01,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-16 00:18:01,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:01,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:18:01,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:01,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2019-11-16 00:18:01,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:18:01,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:18:01,467 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:01,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2019-11-16 00:18:01,468 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:18:01,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:01,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:18:01,475 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:14 [2019-11-16 00:18:02,485 WARN L191 SmtUtils]: Spent 967.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-16 00:18:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:18:02,501 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:18:02,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2019-11-16 00:18:02,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069792387] [2019-11-16 00:18:02,502 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:18:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 4 times [2019-11-16 00:18:02,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:02,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958391901] [2019-11-16 00:18:02,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:02,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:02,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:02,512 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:18:02,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:02,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:18:02,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:18:02,617 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. cyclomatic complexity: 13 Second operand 19 states. [2019-11-16 00:18:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:04,265 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2019-11-16 00:18:04,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-16 00:18:04,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 205 transitions. [2019-11-16 00:18:04,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:18:04,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 118 states and 135 transitions. [2019-11-16 00:18:04,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-16 00:18:04,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-16 00:18:04,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 135 transitions. [2019-11-16 00:18:04,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:18:04,269 INFO L688 BuchiCegarLoop]: Abstraction has 118 states and 135 transitions. [2019-11-16 00:18:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 135 transitions. [2019-11-16 00:18:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 77. [2019-11-16 00:18:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-16 00:18:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-11-16 00:18:04,274 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-11-16 00:18:04,274 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-11-16 00:18:04,274 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:18:04,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 87 transitions. [2019-11-16 00:18:04,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:18:04,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:18:04,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:18:04,278 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:04,278 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:18:04,279 INFO L791 eck$LassoCheckResult]: Stem: 2258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2230#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 2231#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 2241#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 2247#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2248#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2249#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2268#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2250#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2251#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2260#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2269#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2259#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2252#L509-5 strlen_#res := strlen_~i~0; 2232#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 2233#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2234#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2235#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2225#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2226#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2238#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2255#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2236#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2237#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2244#L509-11 strlen_#res := strlen_~i~0; 2245#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 2261#L529 assume !(0 == strstr_~nl~0 % 4294967296); 2262#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 2266#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2267#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2288#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2287#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2264#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2265#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2220#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2221#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 2274#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 2273#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 2271#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2270#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2227#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2222#L517-3 [2019-11-16 00:18:04,279 INFO L793 eck$LassoCheckResult]: Loop: 2222#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2218#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2219#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2222#L517-3 [2019-11-16 00:18:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1050158307, now seen corresponding path program 2 times [2019-11-16 00:18:04,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:04,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620732259] [2019-11-16 00:18:04,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:04,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:04,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:18:04,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620732259] [2019-11-16 00:18:04,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10657120] [2019-11-16 00:18:04,534 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:04,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:18:04,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:18:04,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:18:04,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:18:04,875 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:18:04,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2019-11-16 00:18:04,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843697389] [2019-11-16 00:18:04,877 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:18:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 5 times [2019-11-16 00:18:04,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:04,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448540673] [2019-11-16 00:18:04,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:04,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:04,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:04,887 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:18:04,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:18:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:18:04,994 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. cyclomatic complexity: 17 Second operand 19 states. [2019-11-16 00:18:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:05,247 INFO L93 Difference]: Finished difference Result 259 states and 296 transitions. [2019-11-16 00:18:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:18:05,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 259 states and 296 transitions. [2019-11-16 00:18:05,250 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-11-16 00:18:05,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 259 states to 238 states and 274 transitions. [2019-11-16 00:18:05,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-11-16 00:18:05,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-11-16 00:18:05,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 274 transitions. [2019-11-16 00:18:05,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:18:05,254 INFO L688 BuchiCegarLoop]: Abstraction has 238 states and 274 transitions. [2019-11-16 00:18:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 274 transitions. [2019-11-16 00:18:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 91. [2019-11-16 00:18:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-16 00:18:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-11-16 00:18:05,272 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-16 00:18:05,272 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-16 00:18:05,272 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-16 00:18:05,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 103 transitions. [2019-11-16 00:18:05,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:18:05,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:18:05,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:18:05,275 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:05,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:18:05,281 INFO L791 eck$LassoCheckResult]: Stem: 2745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2716#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 2717#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 2725#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 2732#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2733#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2736#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2756#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2737#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2738#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2748#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2757#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2758#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2739#L509-5 strlen_#res := strlen_~i~0; 2740#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 2734#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2735#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2770#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2769#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2767#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2768#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2785#L509-11 strlen_#res := strlen_~i~0; 2784#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 2783#L529 assume !(0 == strstr_~nl~0 % 4294967296); 2782#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 2781#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2779#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2778#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2776#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2777#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2775#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2774#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2773#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 2743#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 2744#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 2749#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2750#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2772#L532 assume !strstr_#t~short17; 2766#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 2764#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2762#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2713#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2710#L517-3 [2019-11-16 00:18:05,281 INFO L793 eck$LassoCheckResult]: Loop: 2710#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2706#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2707#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2710#L517-3 [2019-11-16 00:18:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:05,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1867103268, now seen corresponding path program 1 times [2019-11-16 00:18:05,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:05,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160987621] [2019-11-16 00:18:05,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:05,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:05,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:18:05,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160987621] [2019-11-16 00:18:05,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16224973] [2019-11-16 00:18:05,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a6b2285-449a-46fc-93a4-def694f7b489/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:05,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:18:05,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:18:05,842 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:18:05,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2019-11-16 00:18:05,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888430773] [2019-11-16 00:18:05,843 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:18:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 6 times [2019-11-16 00:18:05,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:05,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659068580] [2019-11-16 00:18:05,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:05,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:05,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:05,856 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:18:05,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:05,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:18:05,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:18:05,970 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. cyclomatic complexity: 19 Second operand 16 states. [2019-11-16 00:18:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:06,284 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2019-11-16 00:18:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:18:06,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 223 transitions. [2019-11-16 00:18:06,287 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-11-16 00:18:06,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 190 states and 218 transitions. [2019-11-16 00:18:06,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-11-16 00:18:06,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-11-16 00:18:06,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 218 transitions. [2019-11-16 00:18:06,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:18:06,290 INFO L688 BuchiCegarLoop]: Abstraction has 190 states and 218 transitions. [2019-11-16 00:18:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 218 transitions. [2019-11-16 00:18:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 91. [2019-11-16 00:18:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-16 00:18:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-11-16 00:18:06,296 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-11-16 00:18:06,296 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-11-16 00:18:06,296 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-16 00:18:06,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 102 transitions. [2019-11-16 00:18:06,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:18:06,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:18:06,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:18:06,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:06,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:18:06,298 INFO L791 eck$LassoCheckResult]: Stem: 3180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3151#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 3152#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 3161#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3168#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3169#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3172#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3188#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3173#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3174#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3191#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3192#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3181#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 3182#L509-5 strlen_#res := strlen_~i~0; 3155#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3156#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3157#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3158#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3216#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3217#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3218#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3219#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3159#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3160#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3153#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3154#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3177#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 3165#L509-11 strlen_#res := strlen_~i~0; 3162#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 3163#L529 assume !(0 == strstr_~nl~0 % 4294967296); 3166#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 3167#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3187#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 3147#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3144#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3145#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3186#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3224#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3220#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 3197#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 3196#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 3194#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 3193#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3148#L532 assume strstr_#t~short17;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 3146#L517-3 [2019-11-16 00:18:06,298 INFO L793 eck$LassoCheckResult]: Loop: 3146#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3142#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3143#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3146#L517-3 [2019-11-16 00:18:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash -224601240, now seen corresponding path program 3 times [2019-11-16 00:18:06,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:06,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103512469] [2019-11-16 00:18:06,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:06,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:06,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:06,378 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:18:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 7 times [2019-11-16 00:18:06,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:06,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966316880] [2019-11-16 00:18:06,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:06,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:06,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:06,389 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:18:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash 463587919, now seen corresponding path program 4 times [2019-11-16 00:18:06,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:06,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553393053] [2019-11-16 00:18:06,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:06,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:06,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:18:06,518 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:18:10,096 WARN L191 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 475 DAG size of output: 337 [2019-11-16 00:18:10,555 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2019-11-16 00:18:10,559 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:18:10,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:18:10,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:18:10,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:18:10,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:18:10,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:18:10,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:18:10,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:18:10,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration14_Lasso [2019-11-16 00:18:10,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:18:10,560 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:18:10,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,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-11-16 00:18:10,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-11-16 00:18:10,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,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-11-16 00:18:10,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,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-11-16 00:18:10,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:10,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:11,945 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 142 [2019-11-16 00:18:12,265 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-11-16 00:18:12,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:12,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:12,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:12,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:18:12,658 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-16 00:18:13,536 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-16 00:18:13,694 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-16 00:18:14,571 WARN L191 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-11-16 00:18:14,618 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:18:14,618 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:18:14,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,620 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,620 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,623 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,625 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,629 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,631 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,631 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,631 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,631 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,636 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,637 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,638 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,638 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,641 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,645 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,649 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,654 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,654 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,656 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,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-11-16 00:18:14,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,660 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:18:14,660 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:18:14,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,681 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,681 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,683 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:18:14,683 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:18:14,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,686 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:18:14,687 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:18:14,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,690 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,691 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,692 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,692 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,694 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:18:14,695 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:18:14,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,697 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,699 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:18:14,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:18:14,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:18:14,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,703 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,703 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,704 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:18:14,704 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:18:14,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,706 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:18:14,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,707 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:18:14,707 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:18:14,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:18:14,711 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:18:14,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,713 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:18:14,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,717 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:18:14,717 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:18:14,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:18:14,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:18:14,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:18:14,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:18:14,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:18:14,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:18:14,741 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:18:14,741 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:18:14,818 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:18:14,926 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-16 00:18:14,927 INFO L444 ModelExtractionUtils]: 69 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:18:14,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:18:14,928 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:18:14,928 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:18:14,928 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~s~0.offset, v_rep(select #length ULTIMATE.start_memcmp_~s~0.base)_2) = -1*ULTIMATE.start_memcmp_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_memcmp_~s~0.base)_2 Supporting invariants [] [2019-11-16 00:18:15,363 INFO L297 tatePredicateManager]: 77 out of 77 supporting invariants were superfluous and have been removed [2019-11-16 00:18:15,364 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:18:15,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:15,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:18:15,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:15,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:18:15,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:15,491 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-11-16 00:18:15,491 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-16 00:18:15,520 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 118 states and 135 transitions. Complement of second has 7 states. [2019-11-16 00:18:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:18:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:18:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-11-16 00:18:15,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 44 letters. Loop has 3 letters. [2019-11-16 00:18:15,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:18:15,524 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:18:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:15,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:18:15,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:15,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:18:15,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:15,629 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:18:15,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-16 00:18:15,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 118 states and 135 transitions. Complement of second has 7 states. [2019-11-16 00:18:15,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:18:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:18:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-11-16 00:18:15,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 44 letters. Loop has 3 letters. [2019-11-16 00:18:15,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:18:15,651 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:18:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:15,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:18:15,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:15,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:18:15,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:15,746 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 2 loop predicates [2019-11-16 00:18:15,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-16 00:18:15,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 118 states and 135 transitions. Complement of second has 6 states. [2019-11-16 00:18:15,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:18:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:18:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2019-11-16 00:18:15,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 44 letters. Loop has 3 letters. [2019-11-16 00:18:15,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:18:15,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 47 letters. Loop has 3 letters. [2019-11-16 00:18:15,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:18:15,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 44 letters. Loop has 6 letters. [2019-11-16 00:18:15,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:18:15,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 135 transitions. [2019-11-16 00:18:15,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:18:15,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 0 states and 0 transitions. [2019-11-16 00:18:15,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:18:15,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:18:15,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:18:15,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:18:15,780 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:18:15,780 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:18:15,780 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:18:15,780 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-16 00:18:15,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:18:15,780 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:18:15,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:18:15,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:18:15 BoogieIcfgContainer [2019-11-16 00:18:15,787 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:18:15,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:18:15,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:18:15,788 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:18:15,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:43" (3/4) ... [2019-11-16 00:18:15,795 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:18:15,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:18:15,796 INFO L168 Benchmark]: Toolchain (without parser) took 33063.16 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 572.0 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -216.1 MB). Peak memory consumption was 355.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:15,797 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:18:15,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:15,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.62 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:15,811 INFO L168 Benchmark]: Boogie Preprocessor took 45.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:18:15,811 INFO L168 Benchmark]: RCFGBuilder took 501.12 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.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:15,813 INFO L168 Benchmark]: BuchiAutomizer took 31908.29 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 445.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.6 MB). Peak memory consumption was 363.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:15,813 INFO L168 Benchmark]: Witness Printer took 7.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:18:15,816 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 546.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.62 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 501.12 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.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31908.29 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 445.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.6 MB). Peak memory consumption was 363.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.30 ms. Allocated memory is still 1.6 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 14 terminating modules (9 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 unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[haystack] + -1 * haystack and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.8s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 27.9s. Construction of modules took 1.0s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 339 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 91 states and ocurred in iteration 12. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 514 SDtfs, 999 SDslu, 1314 SDs, 0 SdLazy, 1076 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU9 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital293 mio100 ax100 hnf99 lsp89 ukn86 mio100 lsp42 div107 bol100 ite100 ukn100 eq189 hnf86 smp98 dnf251 smp88 tf100 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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...