./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/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 1f6e8c8b965f85c3429105401e9fda59f9f060cb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:36:26,399 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:36:26,400 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:36:26,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:36:26,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:36:26,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:36:26,409 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:36:26,410 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:36:26,411 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:36:26,411 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:36:26,412 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:36:26,412 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:36:26,412 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:36:26,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:36:26,414 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:36:26,414 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:36:26,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:36:26,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:36:26,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:36:26,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:36:26,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:36:26,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:36:26,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:36:26,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:36:26,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:36:26,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:36:26,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:36:26,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:36:26,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:36:26,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:36:26,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:36:26,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:36:26,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:36:26,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:36:26,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:36:26,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:36:26,427 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 06:36:26,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:36:26,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:36:26,439 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:36:26,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:36:26,439 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:36:26,440 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:36:26,440 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:36:26,440 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:36:26,440 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:36:26,440 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:36:26,440 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:36:26,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:36:26,441 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:36:26,441 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:36:26,441 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:36:26,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:36:26,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:36:26,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:36:26,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:36:26,441 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:36:26,441 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:36:26,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:36:26,442 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:36:26,442 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:36:26,442 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:36:26,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:36:26,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:36:26,442 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:36:26,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:36:26,442 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:36:26,443 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:36:26,443 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:36:26,443 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_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2018-11-23 06:36:26,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:36:26,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:36:26,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:36:26,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:36:26,476 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:36:26,476 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-23 06:36:26,513 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/data/69b09d791/34a79ee4ac5c4d73b4146fe753c195da/FLAG7a3e15cba [2018-11-23 06:36:26,840 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:36:26,841 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-23 06:36:26,847 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/data/69b09d791/34a79ee4ac5c4d73b4146fe753c195da/FLAG7a3e15cba [2018-11-23 06:36:26,855 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/data/69b09d791/34a79ee4ac5c4d73b4146fe753c195da [2018-11-23 06:36:26,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:36:26,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:36:26,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:36:26,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:36:26,861 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:36:26,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:36:26" (1/1) ... [2018-11-23 06:36:26,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed7d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:26, skipping insertion in model container [2018-11-23 06:36:26,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:36:26" (1/1) ... [2018-11-23 06:36:26,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:36:26,895 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:36:27,074 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:36:27,082 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:36:27,148 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:36:27,170 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:36:27,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27 WrapperNode [2018-11-23 06:36:27,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:36:27,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:36:27,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:36:27,171 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:36:27,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... [2018-11-23 06:36:27,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... [2018-11-23 06:36:27,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:36:27,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:36:27,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:36:27,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:36:27,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... [2018-11-23 06:36:27,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... [2018-11-23 06:36:27,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... [2018-11-23 06:36:27,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... [2018-11-23 06:36:27,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... [2018-11-23 06:36:27,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... [2018-11-23 06:36:27,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... [2018-11-23 06:36:27,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:36:27,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:36:27,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:36:27,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:36:27,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a0b8c43-1dde-4aeb-b3a0-165a59c04fbf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:36:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:36:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:36:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:36:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:36:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:36:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:36:27,474 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:36:27,474 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 06:36:27,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:36:27 BoogieIcfgContainer [2018-11-23 06:36:27,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:36:27,475 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:36:27,475 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:36:27,478 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:36:27,479 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:36:27,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:36:26" (1/3) ... [2018-11-23 06:36:27,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bbfe848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:36:27, skipping insertion in model container [2018-11-23 06:36:27,480 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:36:27,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:27" (2/3) ... [2018-11-23 06:36:27,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bbfe848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:36:27, skipping insertion in model container [2018-11-23 06:36:27,480 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:36:27,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:36:27" (3/3) ... [2018-11-23 06:36:27,482 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-23 06:36:27,529 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:36:27,530 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:36:27,530 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:36:27,530 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:36:27,530 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:36:27,530 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:36:27,530 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:36:27,530 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:36:27,531 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:36:27,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 06:36:27,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:36:27,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:27,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:27,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:36:27,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:36:27,567 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:36:27,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 06:36:27,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:36:27,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:27,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:27,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:36:27,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:36:27,575 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~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 15#L545-4true [2018-11-23 06:36:27,576 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 9#L548-5true assume !true; 12#L548-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 18#L550true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 13#L545-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 15#L545-4true [2018-11-23 06:36:27,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 06:36:27,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:27,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:27,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:27,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:27,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 06:36:27,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:27,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:27,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:36:27,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:36:27,718 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:36:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:36:27,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:36:27,729 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 06:36:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:36:27,735 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 06:36:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:36:27,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 06:36:27,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:36:27,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 06:36:27,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 06:36:27,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 06:36:27,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 06:36:27,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:36:27,743 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 06:36:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 06:36:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 06:36:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 06:36:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 06:36:27,761 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 06:36:27,761 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 06:36:27,761 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:36:27,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 06:36:27,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:36:27,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:27,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:27,762 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:36:27,762 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:27,762 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 55#L545-4 [2018-11-23 06:36:27,763 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 50#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 46#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 47#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 49#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 55#L545-4 [2018-11-23 06:36:27,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:27,763 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 06:36:27,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:27,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:27,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:27,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:27,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 06:36:27,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:27,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:27,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 06:36:27,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:27,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:28,006 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 06:36:28,152 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 06:36:28,328 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 06:36:28,402 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:36:28,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:36:28,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:36:28,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:36:28,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:36:28,404 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:36:28,404 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:36:28,404 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:36:28,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-23 06:36:28,404 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:36:28,404 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:36:28,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:28,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,059 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:36:29,062 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:36:29,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:29,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:29,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:29,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:29,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:29,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:29,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:29,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:29,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:29,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:29,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:29,069 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:36:29,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:29,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:29,073 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:36:29,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:29,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:29,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-11-23 06:36:29,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:29,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:29,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:29,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:29,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:29,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:29,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:29,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:29,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:29,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:29,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:29,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:29,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:29,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:29,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:29,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:29,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:29,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:29,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:29,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:29,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:29,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:29,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:29,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:29,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:29,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:29,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:29,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:29,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:29,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:29,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:29,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:29,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:29,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:29,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:29,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:29,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:29,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:29,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:29,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:29,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:29,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:29,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:29,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:29,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:29,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:29,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:29,147 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:36:29,161 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:36:29,161 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:36:29,163 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:36:29,164 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:36:29,164 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:36:29,165 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2018-11-23 06:36:29,209 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 06:36:29,214 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:36:29,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:29,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:29,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:29,269 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:36:29,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 06:36:29,329 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-23 06:36:29,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:36:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:36:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 06:36:29,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 06:36:29,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:29,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 06:36:29,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:29,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 06:36:29,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:29,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 06:36:29,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:36:29,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 06:36:29,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 06:36:29,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 06:36:29,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 06:36:29,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:36:29,335 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 06:36:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 06:36:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 06:36:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 06:36:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 06:36:29,336 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 06:36:29,336 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 06:36:29,336 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:36:29,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 06:36:29,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:36:29,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:29,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:29,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:29,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:36:29,338 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 178#L558 assume !(main_~length1~0 < 1); 179#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 195#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 188#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 185#L548-5 [2018-11-23 06:36:29,338 INFO L796 eck$LassoCheckResult]: Loop: 185#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 180#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 181#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 185#L548-5 [2018-11-23 06:36:29,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 06:36:29,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:29,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:29,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:29,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:29,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:29,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 06:36:29,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:29,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:29,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 06:36:29,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:29,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:29,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:29,671 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-23 06:36:29,734 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:36:29,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:36:29,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:36:29,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:36:29,734 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:36:29,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:36:29,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:36:29,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:36:29,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-23 06:36:29,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:36:29,734 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:36:29,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:29,909 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2018-11-23 06:36:30,301 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:36:30,301 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:36:30,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:30,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:30,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:30,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:30,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:30,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:30,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:30,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,344 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:36:30,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,346 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:36:30,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:30,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:30,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:30,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,367 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:36:30,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,368 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:36:30,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:30,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:30,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:30,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:30,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:30,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:30,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:30,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:30,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:30,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:30,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:30,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:30,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:30,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:30,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:30,424 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:36:30,435 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:36:30,435 INFO L444 ModelExtractionUtils]: 37 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 06:36:30,436 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:36:30,437 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:36:30,437 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:36:30,437 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-23 06:36:30,476 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 06:36:30,478 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:36:30,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:30,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:30,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:30,531 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 06:36:30,531 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 06:36:30,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-23 06:36:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:36:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:36:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 06:36:30,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 06:36:30,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:30,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 06:36:30,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:30,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 06:36:30,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:30,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 06:36:30,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:36:30,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 06:36:30,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 06:36:30,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 06:36:30,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 06:36:30,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:36:30,568 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 06:36:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 06:36:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 06:36:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 06:36:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 06:36:30,570 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 06:36:30,570 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 06:36:30,570 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:36:30,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 06:36:30,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:36:30,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:30,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:30,571 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:30,571 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:36:30,571 INFO L794 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 363#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 350#L558 assume !(main_~length1~0 < 1); 351#L558-2 assume !(main_~length2~0 < 1); 356#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 368#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 369#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 371#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 372#L548-1 assume !cstrspn_#t~short7; 358#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 359#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 364#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 365#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 366#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 360#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 357#L548-5 [2018-11-23 06:36:30,571 INFO L796 eck$LassoCheckResult]: Loop: 357#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 352#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 353#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 357#L548-5 [2018-11-23 06:36:30,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:30,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 06:36:30,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:30,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:30,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:30,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:30,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:36:30,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:36:30,628 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:36:30,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:30,628 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 06:36:30,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:30,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:30,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:30,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:30,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:36:30,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:36:30,732 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 06:36:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:36:30,788 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-23 06:36:30,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:36:30,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-23 06:36:30,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 06:36:30,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-23 06:36:30,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 06:36:30,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 06:36:30,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-23 06:36:30,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:36:30,791 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 06:36:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-23 06:36:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 06:36:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 06:36:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 06:36:30,793 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 06:36:30,793 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 06:36:30,793 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:36:30,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 06:36:30,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:36:30,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:30,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:30,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:30,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:36:30,796 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 436#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 422#L558 assume !(main_~length1~0 < 1); 423#L558-2 assume !(main_~length2~0 < 1); 428#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 442#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 443#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 434#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 435#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 444#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 437#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 438#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 439#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 440#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 432#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 429#L548-5 [2018-11-23 06:36:30,796 INFO L796 eck$LassoCheckResult]: Loop: 429#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 424#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 425#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 429#L548-5 [2018-11-23 06:36:30,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 06:36:30,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:30,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:30,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:30,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:30,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:30,814 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 06:36:30,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:30,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:30,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:30,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:30,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:30,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 06:36:30,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:30,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:30,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:31,346 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 133 [2018-11-23 06:36:31,908 WARN L180 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-23 06:36:31,910 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:36:31,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:36:31,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:36:31,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:36:31,910 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:36:31,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:36:31,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:36:31,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:36:31,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-23 06:36:31,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:36:31,910 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:36:31,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:31,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:32,059 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 06:36:32,491 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-23 06:36:32,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:32,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:32,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:32,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:32,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:32,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:36:32,982 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-11-23 06:36:33,175 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:36:33,175 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:36:33,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:33,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:33,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:33,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:33,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:33,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:33,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:33,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:33,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:33,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:33,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:33,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:33,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:33,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:33,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:33,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:33,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:33,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:33,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:33,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:33,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:33,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:33,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:33,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:33,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:33,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:33,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:33,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:33,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:33,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:33,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:36:33,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:36:33,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:36:33,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,197 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:36:33,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,198 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:36:33,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:33,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,204 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-23 06:36:33,204 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 06:36:33,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,224 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-23 06:36:33,225 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 06:36:33,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,327 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:36:33,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,328 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:36:33,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:33,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:36:33,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:36:33,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:36:33,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:36:33,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:36:33,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:36:33,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:36:33,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:36:33,349 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:36:33,363 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:36:33,363 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:36:33,364 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:36:33,364 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:36:33,364 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:36:33,364 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-23 06:36:33,475 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-23 06:36:33,476 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:36:33,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:33,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:33,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:33,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 06:36:33,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 06:36:33,580 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 06:36:33,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:36:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:36:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 06:36:33,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:36:33,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:33,583 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:36:33,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:33,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:33,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:33,653 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 06:36:33,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 06:36:33,689 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 06:36:33,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:36:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:36:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 06:36:33,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:36:33,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:33,695 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:36:33,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:33,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:33,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:33,798 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 06:36:33,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 06:36:33,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-11-23 06:36:33,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:36:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:36:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 06:36:33,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:36:33,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:33,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 06:36:33,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:33,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 06:36:33,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:36:33,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-23 06:36:33,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:36:33,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-23 06:36:33,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:36:33,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:36:33,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:36:33,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:36:33,831 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:36:33,831 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:36:33,831 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:36:33,831 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:36:33,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:36:33,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:36:33,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:36:33,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:36:33 BoogieIcfgContainer [2018-11-23 06:36:33,837 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:36:33,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:36:33,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:36:33,838 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:36:33,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:36:27" (3/4) ... [2018-11-23 06:36:33,841 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:36:33,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:36:33,842 INFO L168 Benchmark]: Toolchain (without parser) took 6984.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 406.3 MB). Free memory was 957.6 MB in the beginning and 1.4 GB in the end (delta: -419.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:36:33,842 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:36:33,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -197.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:33,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:33,844 INFO L168 Benchmark]: Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:36:33,844 INFO L168 Benchmark]: RCFGBuilder took 258.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:33,844 INFO L168 Benchmark]: BuchiAutomizer took 6362.40 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -247.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:36:33,845 INFO L168 Benchmark]: Witness Printer took 3.71 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:36:33,851 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -197.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 258.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6362.40 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -247.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.71 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 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 unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 122 SDslu, 72 SDs, 0 SdLazy, 103 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax100 hnf99 lsp91 ukn70 mio100 lsp31 div136 bol100 ite100 ukn100 eq161 hnf77 smp95 dnf675 smp24 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 122ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...