./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bee04d628cc50c5f036e0a10e9bd347013a62a54 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:03:08,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:03:08,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:03:08,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:03:08,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:03:08,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:03:08,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:03:08,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:03:08,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:03:08,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:03:08,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:03:08,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:03:08,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:03:08,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:03:08,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:03:08,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:03:08,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:03:08,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:03:08,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:03:08,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:03:08,189 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:03:08,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:03:08,193 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:03:08,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:03:08,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:03:08,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:03:08,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:03:08,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:03:08,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:03:08,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:03:08,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:03:08,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:03:08,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:03:08,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:03:08,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:03:08,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:03:08,206 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:03:08,223 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:03:08,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:03:08,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:03:08,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:03:08,226 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:03:08,226 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:03:08,226 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:03:08,226 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:03:08,227 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:03:08,227 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:03:08,227 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:03:08,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:03:08,227 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:03:08,228 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:03:08,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:03:08,229 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:03:08,229 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:03:08,229 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:03:08,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:03:08,230 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:03:08,230 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:03:08,230 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:03:08,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:03:08,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:03:08,232 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:03:08,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:03:08,232 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:03:08,232 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:03:08,234 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:03:08,234 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bee04d628cc50c5f036e0a10e9bd347013a62a54 [2019-01-01 22:03:08,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:03:08,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:03:08,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:03:08,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:03:08,296 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:03:08,296 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i [2019-01-01 22:03:08,370 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c0f2232/050456d6a78b4301bba968a0271ce463/FLAG0bbf5c513 [2019-01-01 22:03:08,902 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:03:08,903 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i [2019-01-01 22:03:08,916 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c0f2232/050456d6a78b4301bba968a0271ce463/FLAG0bbf5c513 [2019-01-01 22:03:09,178 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c0f2232/050456d6a78b4301bba968a0271ce463 [2019-01-01 22:03:09,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:03:09,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:03:09,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:03:09,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:03:09,188 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:03:09,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:09,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744c2293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09, skipping insertion in model container [2019-01-01 22:03:09,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:09,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:03:09,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:03:09,685 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:03:09,705 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:03:09,756 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:03:09,908 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:03:09,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09 WrapperNode [2019-01-01 22:03:09,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:03:09,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:03:09,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:03:09,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:03:09,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:09,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:09,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:03:09,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:03:09,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:03:09,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:03:09,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:09,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:09,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:09,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:09,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:09,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:10,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... [2019-01-01 22:03:10,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:03:10,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:03:10,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:03:10,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:03:10,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:03:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:03:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:03:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:03:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:03:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:03:10,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:03:10,708 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:03:10,709 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 22:03:10,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:10 BoogieIcfgContainer [2019-01-01 22:03:10,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:03:10,710 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:03:10,710 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:03:10,715 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:03:10,716 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:10,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:03:09" (1/3) ... [2019-01-01 22:03:10,718 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290c799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:03:10, skipping insertion in model container [2019-01-01 22:03:10,718 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:10,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:03:09" (2/3) ... [2019-01-01 22:03:10,719 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290c799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:03:10, skipping insertion in model container [2019-01-01 22:03:10,719 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:10,719 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:10" (3/3) ... [2019-01-01 22:03:10,722 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_mixed_alloca_true-termination.c.i [2019-01-01 22:03:10,798 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:03:10,799 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:03:10,799 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:03:10,800 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:03:10,800 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:03:10,800 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:03:10,800 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:03:10,801 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:03:10,801 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:03:10,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:03:10,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:03:10,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:10,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:10,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:03:10,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:03:10,855 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:03:10,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:03:10,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:03:10,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:10,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:10,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:03:10,859 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:03:10,867 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2019-01-01 22:03:10,867 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2019-01-01 22:03:10,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 22:03:10,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:10,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:10,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:11,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-01 22:03:11,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:11,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:11,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:11,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:11,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:03:11,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:03:11,137 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:03:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 22:03:11,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 22:03:11,158 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-01 22:03:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:03:11,166 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-01 22:03:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 22:03:11,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-01 22:03:11,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:03:11,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-01 22:03:11,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 22:03:11,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:03:11,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-01 22:03:11,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:03:11,179 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:03:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-01 22:03:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 22:03:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 22:03:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-01 22:03:11,210 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:03:11,210 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:03:11,210 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:03:11,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-01 22:03:11,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:03:11,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:11,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:11,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:03:11,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:03:11,212 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2019-01-01 22:03:11,213 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2019-01-01 22:03:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-01 22:03:11,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:11,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:11,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-01 22:03:11,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:11,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:11,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:03:11,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:11,362 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-01 22:03:11,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:11,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:11,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:12,295 WARN L181 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-01 22:03:13,170 WARN L181 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-01-01 22:03:13,575 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-01-01 22:03:13,751 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-01 22:03:13,765 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:03:13,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:03:13,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:03:13,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:03:13,767 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:03:13,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:03:13,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:03:13,767 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:03:13,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 22:03:13,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:03:13,768 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:03:13,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:13,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,381 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-01 22:03:14,730 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-01 22:03:14,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:14,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:15,732 WARN L181 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 22:03:15,852 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 22:03:16,235 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-01-01 22:03:16,362 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:03:16,368 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:03:16,371 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 [2019-01-01 22:03:16,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,381 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 [2019-01-01 22:03:16,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:16,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:16,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,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 [2019-01-01 22:03:16,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,397 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 [2019-01-01 22:03:16,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:16,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:16,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:16,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,411 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 [2019-01-01 22:03:16,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:16,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,422 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 [2019-01-01 22:03:16,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,428 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 [2019-01-01 22:03:16,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,433 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 [2019-01-01 22:03:16,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,439 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 [2019-01-01 22:03:16,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,444 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 [2019-01-01 22:03:16,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,450 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 [2019-01-01 22:03:16,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:16,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,460 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 [2019-01-01 22:03:16,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,465 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 [2019-01-01 22:03:16,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:16,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:16,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:16,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,483 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:03:16,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,496 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:03:16,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:16,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,568 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 [2019-01-01 22:03:16,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:16,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:16,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,583 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 [2019-01-01 22:03:16,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,584 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 22:03:16,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,589 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:03:16,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,621 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 [2019-01-01 22:03:16,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:16,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:16,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:16,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,627 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 [2019-01-01 22:03:16,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:16,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:16,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:16,648 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 [2019-01-01 22:03:16,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:16,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:16,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:16,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:16,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:16,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:16,728 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:03:16,792 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:03:16,794 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:03:16,797 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:03:16,798 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:03:16,798 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:03:16,799 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2019-01-01 22:03:16,978 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-01-01 22:03:16,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:03:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:17,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:17,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:17,101 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:03:17,102 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 22:03:17,220 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. [2019-01-01 22:03:17,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:03:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:03:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-01 22:03:17,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 22:03:17,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:17,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-01 22:03:17,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:17,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-01 22:03:17,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:17,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-01 22:03:17,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:17,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-01 22:03:17,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 22:03:17,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 22:03:17,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-01 22:03:17,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:03:17,230 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:03:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-01 22:03:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 22:03:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:03:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-01 22:03:17,233 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:03:17,233 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:03:17,233 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:03:17,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-01 22:03:17,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:17,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:17,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:17,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:03:17,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:03:17,235 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 183#L382 assume !(main_~length1~0 < 1); 184#L382-2 assume !(main_~length2~0 < 1); 181#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 178#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 180#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 190#L372-5 [2019-01-01 22:03:17,235 INFO L796 eck$LassoCheckResult]: Loop: 190#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 185#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 186#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 190#L372-5 [2019-01-01 22:03:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-01 22:03:17,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-01 22:03:17,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:17,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-01 22:03:17,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:17,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:17,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:17,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:17,626 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-01 22:03:17,772 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 22:03:18,196 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-01-01 22:03:18,365 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-01 22:03:18,370 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:03:18,370 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:03:18,370 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:03:18,370 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:03:18,370 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:03:18,370 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:03:18,370 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:03:18,370 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:03:18,370 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 22:03:18,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:03:18,371 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:03:18,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:18,889 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-01-01 22:03:19,066 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-01-01 22:03:19,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:19,549 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 22:03:19,873 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 22:03:20,528 WARN L181 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:03:20,651 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 22:03:20,720 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:03:20,721 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:03:20,721 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 [2019-01-01 22:03:20,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,724 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 [2019-01-01 22:03:20,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:20,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:20,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,728 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 [2019-01-01 22:03:20,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,730 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 [2019-01-01 22:03:20,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,732 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 [2019-01-01 22:03:20,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,734 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 [2019-01-01 22:03:20,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:20,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:20,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,737 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 [2019-01-01 22:03:20,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:20,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:20,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,741 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 [2019-01-01 22:03:20,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,743 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 [2019-01-01 22:03:20,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,745 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 [2019-01-01 22:03:20,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,747 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 [2019-01-01 22:03:20,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,749 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 [2019-01-01 22:03:20,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,752 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 [2019-01-01 22:03:20,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,754 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 [2019-01-01 22:03:20,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,756 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 [2019-01-01 22:03:20,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:20,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:20,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:20,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,758 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 [2019-01-01 22:03:20,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:20,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:20,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,766 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 [2019-01-01 22:03:20,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:20,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:20,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,769 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 [2019-01-01 22:03:20,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:20,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:20,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,773 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 [2019-01-01 22:03:20,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,774 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:03:20,774 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 22:03:20,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,823 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-01 22:03:20,823 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 22:03:20,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:03:20,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:20,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:20,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,955 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 [2019-01-01 22:03:20,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,955 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:03:20,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,962 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:03:20,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:20,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:20,984 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 [2019-01-01 22:03:20,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:20,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:20,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:20,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:20,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:20,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:21,012 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:03:21,046 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:03:21,046 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:03:21,047 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:03:21,049 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:03:21,049 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:03:21,049 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2019-01-01 22:03:21,335 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-01-01 22:03:21,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:21,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:21,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:21,497 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:03:21,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:03:21,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-01-01 22:03:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:03:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:03:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-01 22:03:21,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 22:03:21,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:21,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 22:03:21,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:21,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 22:03:21,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:21,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-01 22:03:21,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:21,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-01 22:03:21,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:03:21,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:03:21,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-01 22:03:21,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:03:21,545 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-01 22:03:21,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-01 22:03:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-01 22:03:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 22:03:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-01 22:03:21,548 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 22:03:21,548 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 22:03:21,548 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:03:21,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-01 22:03:21,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:03:21,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:21,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:21,552 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:03:21,552 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:03:21,552 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 360#L382 assume !(main_~length1~0 < 1); 361#L382-2 assume !(main_~length2~0 < 1); 358#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 354#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 355#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 368#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 364#L372-1 assume !cstrcspn_#t~short210; 365#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208; 350#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 351#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 352#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 353#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 357#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 367#L372-5 [2019-01-01 22:03:21,552 INFO L796 eck$LassoCheckResult]: Loop: 367#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 362#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 363#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 367#L372-5 [2019-01-01 22:03:21,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:21,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-01 22:03:21,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:21,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:21,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:21,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:21,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:21,589 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-01 22:03:21,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:21,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:21,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:21,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:21,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-01-01 22:03:21,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:21,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:21,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:21,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:03:21,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:21,940 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 22:03:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:22,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:03:22,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:03:22,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:22,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:22,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2019-01-01 22:03:22,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 22:03:22,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:03:22,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2019-01-01 22:03:22,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-01-01 22:03:22,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:03:22,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:03:22,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:03:22,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-01 22:03:22,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:18 [2019-01-01 22:03:48,746 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 22:04:03,390 WARN L181 SmtUtils]: Spent 2.59 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 22:04:13,485 WARN L181 SmtUtils]: Spent 9.93 s on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-01-01 22:04:40,320 WARN L181 SmtUtils]: Spent 2.77 s on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 22:04:55,697 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 22:04:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:55,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:04:55,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-01 22:04:55,942 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 22:04:55,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 22:04:55,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2019-01-01 22:04:55,945 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-01-01 22:05:05,696 WARN L181 SmtUtils]: Spent 9.70 s on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-01-01 22:05:19,812 WARN L181 SmtUtils]: Spent 14.05 s on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-01-01 22:05:24,437 WARN L181 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-01-01 22:05:26,977 WARN L181 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 22:05:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:27,042 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-01-01 22:05:27,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 22:05:27,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-01-01 22:05:27,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:27,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-01-01 22:05:27,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 22:05:27,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 22:05:27,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-01-01 22:05:27,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:27,050 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-01 22:05:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-01-01 22:05:27,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-01-01 22:05:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:05:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-01 22:05:27,055 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:05:27,055 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:05:27,055 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:05:27,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-01 22:05:27,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:27,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:27,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:27,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:27,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:27,059 INFO L794 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 520#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 521#L382 assume !(main_~length1~0 < 1); 522#L382-2 assume !(main_~length2~0 < 1); 519#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 515#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 516#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 535#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 525#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 526#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208; 511#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 512#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 513#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 514#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 518#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 528#L372-5 [2019-01-01 22:05:27,059 INFO L796 eck$LassoCheckResult]: Loop: 528#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 523#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 524#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 528#L372-5 [2019-01-01 22:05:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-01 22:05:27,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:27,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:27,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:27,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:27,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:27,095 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-01 22:05:27,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:27,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:27,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:27,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:27,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-01 22:05:27,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:27,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:27,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:27,627 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-01 22:05:27,760 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 22:05:28,622 WARN L181 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 141 [2019-01-01 22:05:29,917 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 113 DAG size of output: 113 [2019-01-01 22:05:29,934 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:29,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:29,934 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:29,934 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:29,934 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:29,934 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:29,934 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:29,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:29,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 22:05:29,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:29,935 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:29,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:29,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:29,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:29,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:29,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:29,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:29,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:29,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:30,264 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 22:05:31,306 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2019-01-01 22:05:31,599 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-01 22:05:31,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:31,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:31,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:31,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:31,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:31,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:31,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:31,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:31,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:31,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:32,053 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-01 22:05:32,774 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:05:33,501 WARN L181 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-01-01 22:05:33,791 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 22:05:33,811 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:33,811 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:33,812 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 [2019-01-01 22:05:33,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:33,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:33,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:33,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,820 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 [2019-01-01 22:05:33,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:33,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:33,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:33,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,826 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 [2019-01-01 22:05:33,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:33,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:33,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:33,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,833 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 [2019-01-01 22:05:33,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:33,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:33,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,840 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 [2019-01-01 22:05:33,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:33,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:33,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:33,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,848 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 [2019-01-01 22:05:33,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:33,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:33,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:33,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,853 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 [2019-01-01 22:05:33,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:33,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:33,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:33,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,855 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 [2019-01-01 22:05:33,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:33,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:33,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,871 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 [2019-01-01 22:05:33,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:33,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:33,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,877 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 [2019-01-01 22:05:33,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:33,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:33,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,884 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 [2019-01-01 22:05:33,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:33,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:33,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:33,890 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 [2019-01-01 22:05:33,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:33,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:33,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:33,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:33,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:33,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:33,932 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:33,947 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 22:05:33,947 INFO L444 ModelExtractionUtils]: 47 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 22:05:33,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:33,949 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:33,949 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:33,950 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2019-01-01 22:05:34,466 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2019-01-01 22:05:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:34,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:34,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:34,524 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:05:34,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 22:05:34,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-01-01 22:05:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-01 22:05:34,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:05:34,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:34,553 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:05:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:34,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:34,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:34,606 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:05:34,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 22:05:34,631 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-01-01 22:05:34,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-01 22:05:34,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:05:34,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:34,634 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:05:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:34,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:34,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:34,719 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:05:34,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 22:05:34,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2019-01-01 22:05:34,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-01 22:05:34,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:05:34,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:34,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 22:05:34,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:34,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 22:05:34,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:34,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-01-01 22:05:34,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:05:34,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-01-01 22:05:34,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:05:34,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:05:34,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:05:34,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:34,759 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:05:34,759 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:05:34,759 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:05:34,759 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:05:34,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:05:34,759 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:05:34,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:05:34,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:05:34 BoogieIcfgContainer [2019-01-01 22:05:34,771 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:05:34,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:05:34,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:05:34,771 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:05:34,772 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:10" (3/4) ... [2019-01-01 22:05:34,778 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:05:34,778 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:05:34,780 INFO L168 Benchmark]: Toolchain (without parser) took 145597.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.5 MB). Free memory was 944.7 MB in the beginning and 874.1 MB in the end (delta: 70.6 MB). Peak memory consumption was 330.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:34,781 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:34,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:34,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:34,785 INFO L168 Benchmark]: Boogie Preprocessor took 41.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:34,786 INFO L168 Benchmark]: RCFGBuilder took 699.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:34,786 INFO L168 Benchmark]: BuchiAutomizer took 144060.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 874.1 MB in the end (delta: 211.9 MB). Peak memory consumption was 347.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:34,789 INFO L168 Benchmark]: Witness Printer took 7.05 ms. Allocated memory is still 1.3 GB. Free memory is still 874.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:34,794 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 725.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 699.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 144060.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 874.1 MB in the end (delta: 211.9 MB). Peak memory consumption was 347.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.05 ms. Allocated memory is still 1.3 GB. Free memory is still 874.1 MB. 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 * 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 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 143.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 111.9s. Construction of modules took 0.2s. Büchi inclusion checks took 31.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, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 153 SDslu, 81 SDs, 0 SdLazy, 135 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp36 div116 bol100 ite100 ukn100 eq180 hnf83 smp94 dnf855 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 169ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...