./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_c1482d15-ed4c-4d15-84be-58d5f0dcf416/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/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_c1482d15-ed4c-4d15-84be-58d5f0dcf416/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/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-01 20:17:00,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 20:17:00,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 20:17:00,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 20:17:00,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 20:17:00,987 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 20:17:00,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 20:17:00,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 20:17:00,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 20:17:00,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 20:17:00,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 20:17:00,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 20:17:00,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 20:17:00,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 20:17:00,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 20:17:00,993 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 20:17:00,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 20:17:00,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 20:17:00,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 20:17:00,996 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 20:17:00,997 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 20:17:00,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 20:17:00,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 20:17:00,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 20:17:00,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 20:17:00,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 20:17:01,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 20:17:01,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 20:17:01,000 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 20:17:01,001 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 20:17:01,001 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 20:17:01,002 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 20:17:01,002 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 20:17:01,002 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 20:17:01,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 20:17:01,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 20:17:01,003 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 20:17:01,011 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 20:17:01,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 20:17:01,012 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 20:17:01,012 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 20:17:01,012 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 20:17:01,012 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 20:17:01,012 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 20:17:01,012 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 20:17:01,012 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 20:17:01,012 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 20:17:01,012 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 20:17:01,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 20:17:01,013 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 20:17:01,013 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 20:17:01,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 20:17:01,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 20:17:01,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 20:17:01,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 20:17:01,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 20:17:01,014 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 20:17:01,014 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 20:17:01,014 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 20:17:01,014 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 20:17:01,014 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 20:17:01,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 20:17:01,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 20:17:01,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 20:17:01,014 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 20:17:01,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 20:17:01,015 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 20:17:01,015 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 20:17:01,015 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 20:17:01,015 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_c1482d15-ed4c-4d15-84be-58d5f0dcf416/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-01 20:17:01,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 20:17:01,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 20:17:01,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 20:17:01,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 20:17:01,045 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 20:17:01,045 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-01 20:17:01,081 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/bin-2019/uautomizer/data/940548947/7a0d969a1c99468d9a7196905520df64/FLAG35d0ec2fb [2018-12-01 20:17:01,464 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 20:17:01,464 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-01 20:17:01,470 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/bin-2019/uautomizer/data/940548947/7a0d969a1c99468d9a7196905520df64/FLAG35d0ec2fb [2018-12-01 20:17:01,827 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/bin-2019/uautomizer/data/940548947/7a0d969a1c99468d9a7196905520df64 [2018-12-01 20:17:01,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 20:17:01,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 20:17:01,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 20:17:01,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 20:17:01,834 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 20:17:01,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:17:01" (1/1) ... [2018-12-01 20:17:01,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b7dfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:01, skipping insertion in model container [2018-12-01 20:17:01,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:17:01" (1/1) ... [2018-12-01 20:17:01,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 20:17:01,880 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 20:17:02,050 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 20:17:02,057 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 20:17:02,113 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 20:17:02,133 INFO L195 MainTranslator]: Completed translation [2018-12-01 20:17:02,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02 WrapperNode [2018-12-01 20:17:02,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 20:17:02,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 20:17:02,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 20:17:02,134 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 20:17:02,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... [2018-12-01 20:17:02,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... [2018-12-01 20:17:02,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 20:17:02,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 20:17:02,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 20:17:02,159 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 20:17:02,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... [2018-12-01 20:17:02,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... [2018-12-01 20:17:02,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... [2018-12-01 20:17:02,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... [2018-12-01 20:17:02,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... [2018-12-01 20:17:02,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... [2018-12-01 20:17:02,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... [2018-12-01 20:17:02,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 20:17:02,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 20:17:02,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 20:17:02,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 20:17:02,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/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-01 20:17:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 20:17:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 20:17:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 20:17:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 20:17:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 20:17:02,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 20:17:02,317 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 20:17:02,317 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 20:17:02,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:17:02 BoogieIcfgContainer [2018-12-01 20:17:02,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 20:17:02,318 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 20:17:02,318 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 20:17:02,320 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 20:17:02,321 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 20:17:02,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 08:17:01" (1/3) ... [2018-12-01 20:17:02,321 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675d053d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:17:02, skipping insertion in model container [2018-12-01 20:17:02,321 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 20:17:02,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:17:02" (2/3) ... [2018-12-01 20:17:02,322 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675d053d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:17:02, skipping insertion in model container [2018-12-01 20:17:02,322 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 20:17:02,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:17:02" (3/3) ... [2018-12-01 20:17:02,323 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-01 20:17:02,353 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 20:17:02,354 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 20:17:02,354 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 20:17:02,354 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 20:17:02,354 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 20:17:02,354 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 20:17:02,354 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 20:17:02,354 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 20:17:02,354 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 20:17:02,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-01 20:17:02,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 20:17:02,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:17:02,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:17:02,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 20:17:02,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 20:17:02,380 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 20:17:02,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-01 20:17:02,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 20:17:02,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:17:02,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:17:02,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 20:17:02,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 20:17:02,386 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-01 20:17:02,386 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~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 9#L546-3true assume !true; 12#L546-4true [2018-12-01 20:17:02,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-01 20:17:02,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:02,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:02,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:02,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:02,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2018-12-01 20:17:02,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:02,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:17:02,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:17:02,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-01 20:17:02,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 20:17:02,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 20:17:02,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 20:17:02,507 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-12-01 20:17:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:17:02,511 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-01 20:17:02,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 20:17:02,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-01 20:17:02,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 20:17:02,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-12-01 20:17:02,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 20:17:02,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 20:17:02,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-01 20:17:02,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 20:17:02,517 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 20:17:02,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-01 20:17:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-01 20:17:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 20:17:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-01 20:17:02,533 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 20:17:02,533 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 20:17:02,533 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 20:17:02,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-01 20:17:02,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 20:17:02,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:17:02,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:17:02,534 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 20:17:02,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 20:17:02,534 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-01 20:17:02,534 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~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;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~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 42#L546-4 [2018-12-01 20:17:02,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:02,535 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-01 20:17:02,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:02,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:02,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:02,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2018-12-01 20:17:02,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:02,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:02,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:17:02,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:02,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2018-12-01 20:17:02,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:02,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:02,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:02,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:02,828 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-12-01 20:17:02,887 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:17:02,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:17:02,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:17:02,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:17:02,888 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:17:02,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:17:02,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:17:02,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:17:02,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-01 20:17:02,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:17:02,889 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:17:02,904 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-01 20:17:03,137 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-01 20:17:03,139 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-01 20:17:03,140 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-01 20:17:03,141 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-01 20:17:03,142 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-01 20:17:03,143 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-01 20:17:03,144 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-01 20:17:03,145 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-01 20:17:03,146 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-01 20:17:03,147 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-01 20:17:03,149 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-01 20:17:03,150 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-01 20:17:03,151 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-01 20:17:03,152 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-01 20:17:03,153 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-01 20:17:03,405 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:17:03,408 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:17:03,409 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-01 20:17:03,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:03,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:03,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:03,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,416 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-01 20:17:03,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:03,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:03,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,424 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-01 20:17:03,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:03,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:03,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,440 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-01 20:17:03,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,441 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:17:03,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,444 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:17:03,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:03,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,455 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-01 20:17:03,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:03,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:03,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,458 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-01 20:17:03,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:03,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:03,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,462 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-01 20:17:03,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,463 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:17:03,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,465 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:17:03,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:03,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,472 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-01 20:17:03,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:03,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:03,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:03,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,474 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-01 20:17:03,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:03,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:03,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,477 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-01 20:17:03,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:03,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 20:17:03,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,478 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 20:17:03,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:03,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,481 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-01 20:17:03,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:03,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:03,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:03,484 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-01 20:17:03,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:03,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:03,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:03,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:03,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:03,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:03,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:17:03,531 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-01 20:17:03,531 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-01 20:17:03,532 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:17:03,534 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 20:17:03,534 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:17:03,534 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-01 20:17:03,574 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-01 20:17:03,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 20:17:03,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:03,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:03,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:03,661 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-01 20:17:03,663 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-01 20:17:03,663 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-01 20:17:03,711 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-01 20:17:03,712 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-01 20:17:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 20:17:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-01 20:17:03,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-01 20:17:03,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:03,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-01 20:17:03,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:03,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-01 20:17:03,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:03,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-12-01 20:17:03,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 20:17:03,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2018-12-01 20:17:03,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 20:17:03,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 20:17:03,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-01 20:17:03,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 20:17:03,716 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-01 20:17:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-01 20:17:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-01 20:17:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-01 20:17:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-01 20:17:03,717 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-01 20:17:03,717 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-01 20:17:03,717 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 20:17:03,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-01 20:17:03,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 20:17:03,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:17:03,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:17:03,718 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:17:03,718 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 20:17:03,718 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~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 161#L546-3 [2018-12-01 20:17:03,718 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~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 160#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 161#L546-3 [2018-12-01 20:17:03,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:03,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-12-01 20:17:03,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:03,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:03,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:03,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:03,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:03,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2018-12-01 20:17:03,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:03,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:03,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:03,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2018-12-01 20:17:03,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:03,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:03,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:03,985 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2018-12-01 20:17:04,063 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:17:04,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:17:04,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:17:04,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:17:04,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:17:04,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:17:04,064 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:17:04,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:17:04,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-01 20:17:04,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:17:04,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:17:04,067 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-01 20:17:04,068 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-01 20:17:04,070 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-01 20:17:04,071 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-01 20:17:04,072 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-01 20:17:04,073 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-01 20:17:04,074 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-01 20:17:04,075 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-01 20:17:04,076 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-01 20:17:04,077 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-01 20:17:04,078 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-01 20:17:04,079 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-01 20:17:04,246 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-01 20:17:04,247 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-01 20:17:04,248 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-01 20:17:04,249 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-01 20:17:04,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:17:04,469 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:17:04,469 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-01 20:17:04,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:04,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:04,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:04,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,472 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-01 20:17:04,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:04,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:04,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:04,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,473 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-01 20:17:04,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:04,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:04,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:04,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,475 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-01 20:17:04,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:04,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:04,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,477 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-01 20:17:04,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:04,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:04,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:04,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,479 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-01 20:17:04,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:04,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:04,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:04,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,480 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-01 20:17:04,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:04,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:04,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:04,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,482 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-01 20:17:04,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:04,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:04,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:04,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,483 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-01 20:17:04,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:04,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:04,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:04,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,485 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-01 20:17:04,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:04,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:04,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,487 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-01 20:17:04,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:04,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:04,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:04,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,489 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-01 20:17:04,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,489 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:17:04,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,490 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:17:04,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:04,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,495 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-01 20:17:04,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:04,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:04,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,498 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-01 20:17:04,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:04,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:04,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,501 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-01 20:17:04,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:04,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:04,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,504 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-01 20:17:04,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:04,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:04,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,506 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-01 20:17:04,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:04,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:04,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:04,510 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-01 20:17:04,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:04,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:04,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:04,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:04,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:04,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:04,522 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:17:04,529 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 20:17:04,529 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 20:17:04,529 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:17:04,530 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 20:17:04,530 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:17:04,530 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-01 20:17:04,552 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-12-01 20:17:04,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 20:17:04,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:04,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:04,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:04,591 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-01 20:17:04,591 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-01 20:17:04,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 20:17:04,601 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-01 20:17:04,601 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-01 20:17:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 20:17:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-01 20:17:04,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-01 20:17:04,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:04,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-01 20:17:04,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:04,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-01 20:17:04,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:04,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-12-01 20:17:04,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 20:17:04,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2018-12-01 20:17:04,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 20:17:04,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-01 20:17:04,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-12-01 20:17:04,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 20:17:04,606 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-01 20:17:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-12-01 20:17:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-01 20:17:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-01 20:17:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-01 20:17:04,607 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-01 20:17:04,607 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-01 20:17:04,607 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 20:17:04,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-01 20:17:04,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 20:17:04,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:17:04,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:17:04,608 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:17:04,608 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 20:17:04,609 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~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;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~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 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~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 310#L546-3 [2018-12-01 20:17:04,609 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~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 309#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 310#L546-3 [2018-12-01 20:17:04,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:04,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2018-12-01 20:17:04,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:04,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:04,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:04,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:04,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:04,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:04,625 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2018-12-01 20:17:04,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:04,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:04,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:04,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:17:04,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:04,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2018-12-01 20:17:04,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:04,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:04,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:17:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:04,675 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-01 20:17:04,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 20:17:04,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1482d15-ed4c-4d15-84be-58d5f0dcf416/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-01 20:17:04,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:04,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:04,728 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-01 20:17:04,732 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-01 20:17:04,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:17:04,762 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-01 20:17:04,766 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-01 20:17:04,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 20:17:04,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:17:04,796 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-01 20:17:04,801 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-01 20:17:04,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-12-01 20:17:11,485 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-01 20:17:14,951 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-01 20:17:14,954 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-01 20:17:14,957 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-01 20:17:14,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 20:17:14,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 20:17:14,959 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-01 20:17:14,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-12-01 20:17:14,960 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-01 20:17:14,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 20:17:14,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-12-01 20:17:15,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 20:17:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2018-12-01 20:17:15,012 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-12-01 20:17:17,501 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-12-01 20:17:20,457 WARN L180 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-12-01 20:17:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:17:20,491 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-01 20:17:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 20:17:20,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-12-01 20:17:20,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 20:17:20,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-12-01 20:17:20,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-01 20:17:20,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 20:17:20,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-12-01 20:17:20,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 20:17:20,492 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-01 20:17:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-12-01 20:17:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-01 20:17:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-01 20:17:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-01 20:17:20,494 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-01 20:17:20,494 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-01 20:17:20,494 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 20:17:20,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-12-01 20:17:20,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 20:17:20,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:17:20,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:17:20,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:17:20,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 20:17:20,495 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~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;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~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 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~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 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~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 420#L546-3 [2018-12-01 20:17:20,495 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~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 419#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 420#L546-3 [2018-12-01 20:17:20,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2018-12-01 20:17:20,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:20,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:20,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:17:20,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:20,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:20,511 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2018-12-01 20:17:20,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:20,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:20,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:20,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:17:20,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:20,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:20,516 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2018-12-01 20:17:20,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:17:20,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:17:20,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:20,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:17:20,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:17:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:17:21,028 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 160 [2018-12-01 20:17:21,113 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:17:21,113 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:17:21,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:17:21,113 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:17:21,113 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:17:21,113 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:17:21,113 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:17:21,113 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:17:21,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-01 20:17:21,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:17:21,113 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:17:21,115 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-01 20:17:21,116 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-01 20:17:21,117 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-01 20:17:21,118 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-01 20:17:21,119 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-01 20:17:21,120 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-01 20:17:21,121 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-01 20:17:21,122 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-01 20:17:21,123 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-01 20:17:21,125 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-01 20:17:21,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-01 20:17:21,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-01 20:17:21,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-01 20:17:21,131 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-01 20:17:21,391 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-12-01 20:17:21,455 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-01 20:17:21,456 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-01 20:17:21,457 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-01 20:17:22,030 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-01 20:17:22,075 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:17:22,076 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:17:22,076 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-01 20:17:22,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,077 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-01 20:17:22,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,078 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-01 20:17:22,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,079 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-01 20:17:22,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,080 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-01 20:17:22,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:22,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:22,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,081 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-01 20:17:22,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,082 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-01 20:17:22,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,083 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-01 20:17:22,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,084 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-01 20:17:22,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:22,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:22,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,086 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-01 20:17:22,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:22,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:22,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,087 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-01 20:17:22,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,088 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-01 20:17:22,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,089 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-01 20:17:22,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:17:22,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:17:22,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:17:22,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,090 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-01 20:17:22,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,090 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 20:17:22,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 20:17:22,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:22,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,094 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-01 20:17:22,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:22,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:22,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,097 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-01 20:17:22,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:22,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:22,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,098 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-01 20:17:22,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:22,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:22,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,100 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-01 20:17:22,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:22,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:22,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:17:22,102 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-01 20:17:22,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:17:22,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:17:22,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:17:22,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:17:22,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:17:22,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:17:22,115 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:17:22,126 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 20:17:22,126 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 20:17:22,126 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:17:22,126 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 20:17:22,126 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:17:22,127 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-01 20:17:22,200 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-12-01 20:17:22,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 20:17:22,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:22,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:22,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:22,244 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-01 20:17:22,244 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-01 20:17:22,244 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 20:17:22,260 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-01 20:17:22,260 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-01 20:17:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 20:17:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-01 20:17:22,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-01 20:17:22,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:22,260 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 20:17:22,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:22,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:22,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:22,300 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-01 20:17:22,301 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-01 20:17:22,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 20:17:22,319 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-01 20:17:22,319 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-01 20:17:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 20:17:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-01 20:17:22,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-01 20:17:22,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:22,320 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 20:17:22,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:17:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:22,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:17:22,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:17:22,372 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-01 20:17:22,372 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-01 20:17:22,372 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 20:17:22,387 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-01 20:17:22,387 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-01 20:17:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 20:17:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-12-01 20:17:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-01 20:17:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-01 20:17:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-01 20:17:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:17:22,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-12-01 20:17:22,389 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 20:17:22,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-12-01 20:17:22,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 20:17:22,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 20:17:22,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 20:17:22,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 20:17:22,389 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:17:22,389 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:17:22,389 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:17:22,389 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 20:17:22,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 20:17:22,389 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 20:17:22,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 20:17:22,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 08:17:22 BoogieIcfgContainer [2018-12-01 20:17:22,393 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 20:17:22,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 20:17:22,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 20:17:22,394 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 20:17:22,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:17:02" (3/4) ... [2018-12-01 20:17:22,396 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 20:17:22,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 20:17:22,396 INFO L168 Benchmark]: Toolchain (without parser) took 20566.61 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -260.7 MB). Peak memory consumption was 81.1 MB. Max. memory is 11.5 GB. [2018-12-01 20:17:22,397 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-01 20:17:22,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-01 20:17:22,397 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-01 20:17:22,398 INFO L168 Benchmark]: Boogie Preprocessor took 14.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 20:17:22,398 INFO L168 Benchmark]: RCFGBuilder took 144.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-12-01 20:17:22,398 INFO L168 Benchmark]: BuchiAutomizer took 20075.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.4 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. [2018-12-01 20:17:22,398 INFO L168 Benchmark]: Witness Printer took 2.51 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 20:17:22,400 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 302.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 144.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20075.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.4 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.51 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 20.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.1s. 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: 14ms 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...