./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37ce12f320cb92b62d01decbfb4f63ee1143a42a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:17:30,939 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:17:30,940 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:17:30,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:17:30,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:17:30,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:17:30,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:17:30,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:17:30,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:17:30,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:17:30,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:17:30,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:17:30,950 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:17:30,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:17:30,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:17:30,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:17:30,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:17:30,953 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:17:30,953 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:17:30,954 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:17:30,955 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:17:30,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:17:30,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:17:30,957 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:17:30,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:17:30,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:17:30,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:17:30,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:17:30,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:17:30,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:17:30,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:17:30,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:17:30,960 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:17:30,960 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:17:30,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:17:30,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:17:30,961 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 14:17:30,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:17:30,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:17:30,971 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:17:30,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:17:30,971 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 14:17:30,971 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 14:17:30,971 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 14:17:30,971 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 14:17:30,972 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 14:17:30,972 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 14:17:30,972 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 14:17:30,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:17:30,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:17:30,972 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:17:30,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:17:30,973 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:17:30,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:17:30,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 14:17:30,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 14:17:30,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 14:17:30,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:17:30,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 14:17:30,974 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 14:17:30,974 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:17:30,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 14:17:30,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:17:30,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:17:30,974 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 14:17:30,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:17:30,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 14:17:30,975 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 14:17:30,975 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 14:17:30,976 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2018-12-08 14:17:30,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:17:31,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:17:31,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:17:31,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:17:31,008 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:17:31,008 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-08 14:17:31,041 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/data/7cc13916c/56a30be52096487891483f7c34a2f0e4/FLAG0dbad019a [2018-12-08 14:17:31,365 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:17:31,365 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-08 14:17:31,371 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/data/7cc13916c/56a30be52096487891483f7c34a2f0e4/FLAG0dbad019a [2018-12-08 14:17:31,769 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/data/7cc13916c/56a30be52096487891483f7c34a2f0e4 [2018-12-08 14:17:31,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:17:31,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:17:31,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:17:31,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:17:31,774 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:17:31,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:17:31" (1/1) ... [2018-12-08 14:17:31,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630eb73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:31, skipping insertion in model container [2018-12-08 14:17:31,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:17:31" (1/1) ... [2018-12-08 14:17:31,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:17:31,801 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:17:31,940 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:17:31,946 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:17:32,001 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:17:32,032 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:17:32,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32 WrapperNode [2018-12-08 14:17:32,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:17:32,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:17:32,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:17:32,033 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:17:32,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... [2018-12-08 14:17:32,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... [2018-12-08 14:17:32,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:17:32,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:17:32,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:17:32,058 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:17:32,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... [2018-12-08 14:17:32,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... [2018-12-08 14:17:32,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... [2018-12-08 14:17:32,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... [2018-12-08 14:17:32,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... [2018-12-08 14:17:32,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... [2018-12-08 14:17:32,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... [2018-12-08 14:17:32,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:17:32,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:17:32,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:17:32,072 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:17:32,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:17:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:17:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 14:17:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:17:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:17:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:17:32,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:17:32,229 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:17:32,229 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 14:17:32,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:17:32 BoogieIcfgContainer [2018-12-08 14:17:32,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:17:32,230 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 14:17:32,230 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 14:17:32,232 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 14:17:32,233 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:17:32,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 02:17:31" (1/3) ... [2018-12-08 14:17:32,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26f14d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:17:32, skipping insertion in model container [2018-12-08 14:17:32,234 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:17:32,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:17:32" (2/3) ... [2018-12-08 14:17:32,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26f14d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:17:32, skipping insertion in model container [2018-12-08 14:17:32,234 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:17:32,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:17:32" (3/3) ... [2018-12-08 14:17:32,236 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-08 14:17:32,269 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 14:17:32,270 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 14:17:32,270 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 14:17:32,270 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 14:17:32,270 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:17:32,270 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:17:32,270 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 14:17:32,270 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:17:32,270 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 14:17:32,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-08 14:17:32,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 14:17:32,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:17:32,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:17:32,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 14:17:32,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 14:17:32,298 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 14:17:32,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-08 14:17:32,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 14:17:32,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:17:32,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:17:32,300 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 14:17:32,300 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 14:17:32,307 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L555true assume !(main_~length1~0 < 1); 11#L555-2true assume !(main_~length2~0 < 1); 4#L558-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 12#L546-4true [2018-12-08 14:17:32,307 INFO L796 eck$LassoCheckResult]: Loop: 12#L546-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 8#L545-1true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 9#L546-3true assume !true; 12#L546-4true [2018-12-08 14:17:32,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-08 14:17:32,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:32,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:32,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:32,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:32,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:32,404 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2018-12-08 14:17:32,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:32,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:32,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:32,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:17:32,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:17:32,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-08 14:17:32,429 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 14:17:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 14:17:32,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 14:17:32,440 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-12-08 14:17:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:17:32,444 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-08 14:17:32,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 14:17:32,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-08 14:17:32,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 14:17:32,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-12-08 14:17:32,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 14:17:32,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 14:17:32,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-08 14:17:32,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:17:32,449 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 14:17:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-08 14:17:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-08 14:17:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 14:17:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-08 14:17:32,465 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 14:17:32,465 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 14:17:32,466 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 14:17:32,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-08 14:17:32,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 14:17:32,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:17:32,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:17:32,467 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 14:17:32,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 14:17:32,467 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 39#L555 assume !(main_~length1~0 < 1); 40#L555-2 assume !(main_~length2~0 < 1); 41#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 42#L546-4 [2018-12-08 14:17:32,467 INFO L796 eck$LassoCheckResult]: Loop: 42#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 43#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 45#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 47#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 42#L546-4 [2018-12-08 14:17:32,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:32,468 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-08 14:17:32,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:32,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:32,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:32,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2018-12-08 14:17:32,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:32,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:17:32,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:32,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:32,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2018-12-08 14:17:32,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:32,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:32,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:32,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:32,783 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-12-08 14:17:32,841 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:17:32,842 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:17:32,842 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:17:32,842 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:17:32,842 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:17:32,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:17:32,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:17:32,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:17:32,843 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-08 14:17:32,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:17:32,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:17:32,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,347 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:17:33,351 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:17:33,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:33,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:33,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:33,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:33,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:33,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:33,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:33,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,380 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:17:33,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,383 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:17:33,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:33,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:33,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:33,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:33,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:33,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,405 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:17:33,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,407 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:17:33,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:33,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:33,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:33,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:33,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:33,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:33,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:33,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,418 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 14:17:33,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,419 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 14:17:33,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:33,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:33,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:33,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:33,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:33,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:33,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:33,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:33,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:33,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:33,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:33,447 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:17:33,466 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 14:17:33,466 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 14:17:33,468 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:17:33,469 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 14:17:33,469 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:17:33,469 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2018-12-08 14:17:33,497 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 14:17:33,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:17:33,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:33,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:33,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:17:33,571 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 14:17:33,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-08 14:17:33,607 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2018-12-08 14:17:33,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:17:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:17:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-08 14:17:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-08 14:17:33,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:33,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-08 14:17:33,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:33,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-08 14:17:33,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:33,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-12-08 14:17:33,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:17:33,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2018-12-08 14:17:33,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 14:17:33,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 14:17:33,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-08 14:17:33,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 14:17:33,613 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 14:17:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-08 14:17:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-08 14:17:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-08 14:17:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-08 14:17:33,615 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-08 14:17:33,615 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-08 14:17:33,615 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 14:17:33,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-08 14:17:33,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:17:33,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:17:33,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:17:33,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:17:33,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 14:17:33,616 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 153#L555 assume !(main_~length1~0 < 1); 154#L555-2 assume !(main_~length2~0 < 1); 155#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 156#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 157#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 161#L546-3 [2018-12-08 14:17:33,616 INFO L796 eck$LassoCheckResult]: Loop: 161#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 164#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 160#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 161#L546-3 [2018-12-08 14:17:33,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-12-08 14:17:33,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:33,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:33,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:33,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:33,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:33,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2018-12-08 14:17:33,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:33,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:33,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:33,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2018-12-08 14:17:33,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:33,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:33,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:33,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:33,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:33,869 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2018-12-08 14:17:33,940 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:17:33,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:17:33,940 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:17:33,940 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:17:33,940 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:17:33,940 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:17:33,940 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:17:33,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:17:33,941 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-08 14:17:33,941 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:17:33,941 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:17:33,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:33,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:34,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:34,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:34,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:34,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:34,366 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:17:34,366 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:17:34,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:34,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:34,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:34,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:34,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:34,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:34,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:34,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:34,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:34,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:34,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:34,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:34,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:34,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:34,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:34,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:34,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:34,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:34,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:34,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:34,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:34,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:34,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:34,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:34,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:34,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:34,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:34,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:34,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:34,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:34,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:34,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,388 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:17:34,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,388 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:17:34,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:34,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:34,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:34,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:34,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:34,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:34,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:34,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:34,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:34,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:34,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:34,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:34,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:34,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:34,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:34,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:34,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:34,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:34,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:34,420 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:17:34,428 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 14:17:34,429 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 14:17:34,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:17:34,429 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 14:17:34,430 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:17:34,430 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-12-08 14:17:34,465 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-12-08 14:17:34,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:17:34,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:34,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:34,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:17:34,504 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 14:17:34,504 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 14:17:34,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 5 states. [2018-12-08 14:17:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:17:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:17:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-08 14:17:34,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 14:17:34,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:34,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 14:17:34,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:34,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-08 14:17:34,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:34,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-12-08 14:17:34,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:17:34,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2018-12-08 14:17:34,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 14:17:34,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 14:17:34,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-12-08 14:17:34,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 14:17:34,518 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-08 14:17:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-12-08 14:17:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-08 14:17:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 14:17:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-08 14:17:34,519 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 14:17:34,519 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 14:17:34,519 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 14:17:34,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-08 14:17:34,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:17:34,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:17:34,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:17:34,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:17:34,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 14:17:34,521 INFO L794 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 300#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 301#L555 assume !(main_~length1~0 < 1); 302#L555-2 assume !(main_~length2~0 < 1); 303#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 304#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 305#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 312#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 314#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 306#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 307#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 310#L546-3 [2018-12-08 14:17:34,521 INFO L796 eck$LassoCheckResult]: Loop: 310#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 313#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 309#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 310#L546-3 [2018-12-08 14:17:34,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2018-12-08 14:17:34,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:34,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:34,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:34,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:34,536 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2018-12-08 14:17:34,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:34,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:34,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:34,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:17:34,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:34,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2018-12-08 14:17:34,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:34,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:34,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:17:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:17:34,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:17:34,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e5902a-a960-48a6-a7fd-ef9d6b39a770/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:17:34,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:34,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:34,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-08 14:17:34,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-08 14:17:34,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:17:34,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-08 14:17:34,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-08 14:17:34,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:17:34,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:17:34,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:17:34,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 14:17:34,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-12-08 14:17:41,377 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 14:17:44,863 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 14:17:44,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-08 14:17:44,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 14:17:44,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:17:44,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:17:44,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:17:44,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-12-08 14:17:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:17:44,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:17:44,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-12-08 14:17:44,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 14:17:44,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2018-12-08 14:17:44,910 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-12-08 14:17:47,398 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-12-08 14:17:50,340 WARN L180 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-12-08 14:17:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:17:50,373 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-08 14:17:50,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 14:17:50,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-12-08 14:17:50,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:17:50,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-12-08 14:17:50,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 14:17:50,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 14:17:50,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-12-08 14:17:50,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 14:17:50,374 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-08 14:17:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-12-08 14:17:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-08 14:17:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 14:17:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-08 14:17:50,375 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-08 14:17:50,375 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-08 14:17:50,375 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 14:17:50,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-12-08 14:17:50,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:17:50,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:17:50,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:17:50,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:17:50,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 14:17:50,376 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 412#L555 assume !(main_~length1~0 < 1); 413#L555-2 assume !(main_~length2~0 < 1); 414#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 415#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 416#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 426#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 425#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 421#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 422#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 427#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 417#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 418#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 420#L546-3 [2018-12-08 14:17:50,376 INFO L796 eck$LassoCheckResult]: Loop: 420#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 424#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 419#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 420#L546-3 [2018-12-08 14:17:50,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2018-12-08 14:17:50,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:50,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:17:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:50,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2018-12-08 14:17:50,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:50,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:50,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:50,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:17:50,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:50,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2018-12-08 14:17:50,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:17:50,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:17:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:50,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:17:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:17:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:17:50,852 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 160 [2018-12-08 14:17:50,946 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:17:50,946 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:17:50,947 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:17:50,947 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:17:50,947 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:17:50,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:17:50,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:17:50,947 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:17:50,947 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-08 14:17:50,947 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:17:50,947 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:17:50,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:50,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:51,251 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-12-08 14:17:51,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:51,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:51,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:17:51,871 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-08 14:17:51,917 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:17:51,917 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:17:51,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:51,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:51,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:51,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:51,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:51,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:51,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:17:51,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:17:51,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:17:51,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,933 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:17:51,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,933 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:17:51,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:51,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:51,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:51,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:51,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:51,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:51,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:51,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:51,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:51,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:17:51,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:17:51,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:17:51,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:17:51,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:17:51,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:17:51,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:17:51,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:17:51,959 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:17:51,970 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 14:17:51,970 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 14:17:51,970 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:17:51,971 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 14:17:51,971 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:17:51,971 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-12-08 14:17:52,045 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-12-08 14:17:52,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:17:52,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:52,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:52,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:17:52,096 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 14:17:52,096 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 14:17:52,110 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 5 states. [2018-12-08 14:17:52,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:17:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:17:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-08 14:17:52,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 14:17:52,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:52,111 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 14:17:52,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:52,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:52,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:17:52,155 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 [2018-12-08 14:17:52,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 14:17:52,174 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2018-12-08 14:17:52,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:17:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:17:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-08 14:17:52,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 14:17:52,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:52,175 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 14:17:52,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:17:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:52,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:17:52,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:17:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:17:52,213 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 [2018-12-08 14:17:52,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 14:17:52,234 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2018-12-08 14:17:52,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:17:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:17:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-12-08 14:17:52,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 14:17:52,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:52,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-08 14:17:52,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:52,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 14:17:52,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:17:52,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-12-08 14:17:52,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:17:52,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-12-08 14:17:52,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 14:17:52,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 14:17:52,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 14:17:52,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:17:52,237 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:17:52,237 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:17:52,237 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:17:52,237 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 14:17:52,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:17:52,237 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:17:52,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 14:17:52,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 02:17:52 BoogieIcfgContainer [2018-12-08 14:17:52,241 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 14:17:52,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:17:52,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:17:52,241 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:17:52,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:17:32" (3/4) ... [2018-12-08 14:17:52,243 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 14:17:52,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:17:52,244 INFO L168 Benchmark]: Toolchain (without parser) took 20473.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -89.3 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. [2018-12-08 14:17:52,245 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:17:52,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-08 14:17:52,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:17:52,245 INFO L168 Benchmark]: Boogie Preprocessor took 14.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:17:52,246 INFO L168 Benchmark]: RCFGBuilder took 157.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:17:52,246 INFO L168 Benchmark]: BuchiAutomizer took 20010.77 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.0 MB). Peak memory consumption was 120.6 MB. Max. memory is 11.5 GB. [2018-12-08 14:17:52,246 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:17:52,248 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 157.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20010.77 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.0 MB). Peak memory consumption was 120.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[scanp] + -1 * scanp and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.0s. Construction of modules took 0.0s. Büchi inclusion checks took 5.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 90 SDtfs, 84 SDslu, 56 SDs, 0 SdLazy, 93 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax100 hnf99 lsp96 ukn80 mio100 lsp43 div100 bol100 ite100 ukn100 eq188 hnf87 smp98 dnf226 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...