./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrspn_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrspn_malloc.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 f55019e0bbd691300fed0d54b866c64772e1d73ec8a359d22e1dcd292c7e1531 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:05:42,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:05:42,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:05:42,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:05:42,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:05:42,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:05:42,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:05:42,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:05:42,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:05:42,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:05:42,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:05:42,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:05:42,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:05:42,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:05:42,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:05:42,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:05:42,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:05:42,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:05:42,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:05:42,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:05:42,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:05:42,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:05:42,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:05:42,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:05:42,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:05:42,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:05:42,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:05:42,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:05:42,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:05:42,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:05:42,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:05:42,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:05:42,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:05:42,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:05:42,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:05:42,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:05:42,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:05:42,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:05:42,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:05:42,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:05:42,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:05:42,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 17:05:42,931 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:05:42,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:05:42,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:05:42,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:05:42,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:05:42,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:05:42,934 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:05:42,934 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:05:42,934 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:05:42,935 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:05:42,935 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:05:42,936 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:05:42,936 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:05:42,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:05:42,936 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:05:42,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:05:42,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:05:42,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:05:42,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:05:42,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:05:42,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:05:42,937 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:05:42,938 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:05:42,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:05:42,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:05:42,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:05:42,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:05:42,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:05:42,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:05:42,940 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:05:42,940 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> f55019e0bbd691300fed0d54b866c64772e1d73ec8a359d22e1dcd292c7e1531 [2021-12-15 17:05:43,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:05:43,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:05:43,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:05:43,177 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:05:43,183 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:05:43,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrspn_malloc.i [2021-12-15 17:05:43,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2301caac9/0c049f48fe334b86b54b9603c9fecf5e/FLAGa3d47d409 [2021-12-15 17:05:43,622 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:05:43,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrspn_malloc.i [2021-12-15 17:05:43,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2301caac9/0c049f48fe334b86b54b9603c9fecf5e/FLAGa3d47d409 [2021-12-15 17:05:43,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2301caac9/0c049f48fe334b86b54b9603c9fecf5e [2021-12-15 17:05:43,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:05:43,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:05:43,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:05:43,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:05:43,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:05:43,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:05:43" (1/1) ... [2021-12-15 17:05:43,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338c3eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:43, skipping insertion in model container [2021-12-15 17:05:43,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:05:43" (1/1) ... [2021-12-15 17:05:43,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:05:43,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:05:43,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:05:43,936 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:05:43,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:05:43,999 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:05:44,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44 WrapperNode [2021-12-15 17:05:44,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:05:44,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:05:44,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:05:44,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:05:44,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,039 INFO L137 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2021-12-15 17:05:44,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:05:44,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:05:44,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:05:44,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:05:44,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:05:44,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:05:44,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:05:44,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:05:44,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (1/1) ... [2021-12-15 17:05:44,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:44,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:44,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:44,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:05:44,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:05:44,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:05:44,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 17:05:44,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:05:44,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:05:44,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:05:44,178 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:05:44,180 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:05:44,339 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:05:44,343 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:05:44,343 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 17:05:44,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:05:44 BoogieIcfgContainer [2021-12-15 17:05:44,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:05:44,345 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:05:44,345 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:05:44,348 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:05:44,349 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:05:44,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:05:43" (1/3) ... [2021-12-15 17:05:44,350 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5620c154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:05:44, skipping insertion in model container [2021-12-15 17:05:44,350 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:05:44,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:05:44" (2/3) ... [2021-12-15 17:05:44,350 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5620c154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:05:44, skipping insertion in model container [2021-12-15 17:05:44,350 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:05:44,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:05:44" (3/3) ... [2021-12-15 17:05:44,352 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc.i [2021-12-15 17:05:44,391 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:05:44,391 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:05:44,391 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:05:44,391 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:05:44,392 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:05:44,392 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:05:44,392 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:05:44,392 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:05:44,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:44,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:05:44,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:05:44,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:05:44,433 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:05:44,433 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:05:44,433 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:05:44,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:44,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:05:44,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:05:44,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:05:44,436 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:05:44,436 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:05:44,441 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 17#L382true assume !(main_~length1~0#1 < 1); 14#L382-2true assume !(main_~length2~0#1 < 1); 5#L385-1true call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 9#L369-4true [2021-12-15 17:05:44,443 INFO L793 eck$LassoCheckResult]: Loop: 9#L369-4true call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 16#L369-1true assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 7#L372-5true assume !true; 6#L372-6true call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 18#L374true assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; 10#L369-3true cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; 9#L369-4true [2021-12-15 17:05:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2021-12-15 17:05:44,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:44,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927672874] [2021-12-15 17:05:44,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:44,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:44,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:44,582 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:44,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2021-12-15 17:05:44,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:44,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038108528] [2021-12-15 17:05:44,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:44,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:44,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:05:44,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038108528] [2021-12-15 17:05:44,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038108528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:05:44,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:05:44,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:05:44,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949551717] [2021-12-15 17:05:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:05:44,621 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:05:44,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:05:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:05:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:05:44,649 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:05:44,654 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2021-12-15 17:05:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:05:44,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2021-12-15 17:05:44,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:05:44,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2021-12-15 17:05:44,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-15 17:05:44,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-15 17:05:44,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2021-12-15 17:05:44,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:05:44,663 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-12-15 17:05:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2021-12-15 17:05:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-15 17:05:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2021-12-15 17:05:44,680 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-12-15 17:05:44,680 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-12-15 17:05:44,681 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:05:44,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2021-12-15 17:05:44,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:05:44,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:05:44,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:05:44,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:05:44,683 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:05:44,683 INFO L791 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 45#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 52#L382 assume !(main_~length1~0#1 < 1); 56#L382-2 assume !(main_~length2~0#1 < 1); 46#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 47#L369-4 [2021-12-15 17:05:44,684 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 53#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 50#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 51#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 55#L372-3 assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; 48#L372-6 call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 49#L374 assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; 54#L369-3 cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; 47#L369-4 [2021-12-15 17:05:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2021-12-15 17:05:44,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:44,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454252285] [2021-12-15 17:05:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:44,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:44,704 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:44,716 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2021-12-15 17:05:44,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:44,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076228105] [2021-12-15 17:05:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:44,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:44,734 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:44,746 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:44,752 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2021-12-15 17:05:44,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:44,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080820194] [2021-12-15 17:05:44,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:44,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:44,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:44,819 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:45,440 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:05:45,440 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:05:45,440 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:05:45,440 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:05:45,440 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:05:45,441 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:45,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:05:45,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:05:45,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration2_Lasso [2021-12-15 17:05:45,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:05:45,441 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:05:45,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:45,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:46,310 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:05:46,313 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:05:46,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:46,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:46,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:46,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-15 17:05:46,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:46,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:46,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:46,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:46,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:46,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:46,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:46,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:46,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:46,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-15 17:05:46,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:46,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:46,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:46,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-15 17:05:46,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:46,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:46,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:46,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:46,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:46,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:46,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:46,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:46,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:46,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:46,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:46,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:46,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-15 17:05:46,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:46,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:46,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:46,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:46,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:46,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:46,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:46,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:46,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:46,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:46,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:46,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:46,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-15 17:05:46,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:46,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:46,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:46,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:46,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:46,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:46,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:46,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:46,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-15 17:05:46,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:46,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:46,477 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:46,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-15 17:05:46,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:46,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:46,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:46,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:46,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:46,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:46,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:46,510 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:05:46,523 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-12-15 17:05:46,523 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2021-12-15 17:05:46,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:46,526 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:46,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-15 17:05:46,541 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:05:46,558 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:05:46,558 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:05:46,559 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_cstrspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0#1.offset Supporting invariants [] [2021-12-15 17:05:46,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:46,601 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2021-12-15 17:05:46,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:46,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:05:46,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:46,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:05:46,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:46,733 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 [2021-12-15 17:05:46,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:46,771 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 28 transitions. Complement of second has 4 states. [2021-12-15 17:05:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:05:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2021-12-15 17:05:46,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2021-12-15 17:05:46,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:46,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2021-12-15 17:05:46,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:46,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2021-12-15 17:05:46,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:46,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2021-12-15 17:05:46,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:05:46,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2021-12-15 17:05:46,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:05:46,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:05:46,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2021-12-15 17:05:46,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:05:46,777 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-12-15 17:05:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2021-12-15 17:05:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-15 17:05:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2021-12-15 17:05:46,779 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-12-15 17:05:46,779 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-12-15 17:05:46,779 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:05:46,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2021-12-15 17:05:46,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:05:46,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:05:46,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:05:46,780 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:05:46,780 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:05:46,780 INFO L791 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 167#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 176#L382 assume !(main_~length1~0#1 < 1); 183#L382-2 assume !(main_~length2~0#1 < 1); 168#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 169#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 178#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 172#L372-5 [2021-12-15 17:05:46,781 INFO L793 eck$LassoCheckResult]: Loop: 172#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 173#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 181#L372-3 assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; 172#L372-5 [2021-12-15 17:05:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2021-12-15 17:05:46,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:46,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283506751] [2021-12-15 17:05:46,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:46,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:46,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:46,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:46,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:46,838 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2021-12-15 17:05:46,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:46,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666091904] [2021-12-15 17:05:46,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:46,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:46,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:46,857 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:46,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2021-12-15 17:05:46,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:46,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703247526] [2021-12-15 17:05:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:46,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:46,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:46,911 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:47,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:47,443 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:05:47,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:05:47,444 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:05:47,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:05:47,444 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:05:47,444 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:47,444 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:05:47,444 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:05:47,444 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration3_Lasso [2021-12-15 17:05:47,444 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:05:47,444 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:05:47,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:47,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:48,331 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:05:48,331 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:05:48,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,333 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-15 17:05:48,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:48,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:48,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:48,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:48,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,376 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-15 17:05:48,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:48,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:48,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:48,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:48,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,417 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-15 17:05:48,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:48,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:48,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:48,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-12-15 17:05:48,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,444 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-15 17:05:48,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:48,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:48,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:48,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:48,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,491 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-15 17:05:48,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:48,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:48,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:48,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,548 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-15 17:05:48,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:48,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:48,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:48,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-15 17:05:48,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,590 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-15 17:05:48,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:48,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:48,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:48,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-15 17:05:48,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,618 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-15 17:05:48,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:48,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:48,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:48,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-15 17:05:48,661 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,662 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-15 17:05:48,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:48,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:48,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:48,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,732 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-15 17:05:48,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,742 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2021-12-15 17:05:48,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,751 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2021-12-15 17:05:48,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:48,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:48,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,804 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-15 17:05:48,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:48,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:48,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-15 17:05:48,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,860 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-15 17:05:48,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:48,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:48,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:48,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,916 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:48,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:48,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:48,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:48,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:48,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-15 17:05:48,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:48,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:48,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:48,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:48,962 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:48,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-15 17:05:48,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:48,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:48,970 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-15 17:05:48,970 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2021-12-15 17:05:48,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:49,011 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2021-12-15 17:05:49,011 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2021-12-15 17:05:49,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:49,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:49,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:49,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:49,115 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:49,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:49,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:49,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:49,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:49,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:49,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-15 17:05:49,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:49,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:49,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:05:49,176 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 17:05:49,176 INFO L444 ModelExtractionUtils]: 32 out of 43 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-12-15 17:05:49,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:49,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:49,177 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:49,179 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:05:49,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-15 17:05:49,197 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:05:49,197 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:05:49,197 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2 Supporting invariants [] [2021-12-15 17:05:49,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:49,231 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2021-12-15 17:05:49,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:49,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:05:49,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:49,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:49,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:05:49,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:49,329 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-15 17:05:49,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:49,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 57 transitions. Complement of second has 6 states. [2021-12-15 17:05:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:05:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2021-12-15 17:05:49,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2021-12-15 17:05:49,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:49,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2021-12-15 17:05:49,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:49,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2021-12-15 17:05:49,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:49,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2021-12-15 17:05:49,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:05:49,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2021-12-15 17:05:49,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-15 17:05:49,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:05:49,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2021-12-15 17:05:49,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:05:49,361 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2021-12-15 17:05:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2021-12-15 17:05:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-12-15 17:05:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-12-15 17:05:49,362 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-12-15 17:05:49,363 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-12-15 17:05:49,363 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:05:49,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2021-12-15 17:05:49,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:05:49,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:05:49,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:05:49,364 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:05:49,364 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:05:49,364 INFO L791 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 336#L382 assume !(main_~length1~0#1 < 1); 345#L382-2 assume !(main_~length2~0#1 < 1); 328#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 329#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 337#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 346#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 343#L372-1 assume !cstrspn_#t~short210#1; 344#L372-3 assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; 330#L372-6 call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 331#L374 assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; 341#L369-3 cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; 338#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 340#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 332#L372-5 [2021-12-15 17:05:49,364 INFO L793 eck$LassoCheckResult]: Loop: 332#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 333#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 342#L372-3 assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; 332#L372-5 [2021-12-15 17:05:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:49,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2021-12-15 17:05:49,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:49,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240180341] [2021-12-15 17:05:49,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:49,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:49,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:05:49,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240180341] [2021-12-15 17:05:49,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240180341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:05:49,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:05:49,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 17:05:49,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004590832] [2021-12-15 17:05:49,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:05:49,404 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:05:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2021-12-15 17:05:49,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:49,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664506303] [2021-12-15 17:05:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:49,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:49,407 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:49,410 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:49,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:05:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 17:05:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 17:05:49,479 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:49,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:05:49,534 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2021-12-15 17:05:49,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 17:05:49,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2021-12-15 17:05:49,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:05:49,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2021-12-15 17:05:49,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-15 17:05:49,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:05:49,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2021-12-15 17:05:49,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:05:49,536 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-12-15 17:05:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2021-12-15 17:05:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-12-15 17:05:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-12-15 17:05:49,538 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-12-15 17:05:49,538 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-12-15 17:05:49,538 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:05:49,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2021-12-15 17:05:49,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:05:49,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:05:49,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:05:49,539 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:05:49,539 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:05:49,539 INFO L791 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 408#L382 assume !(main_~length1~0#1 < 1); 417#L382-2 assume !(main_~length2~0#1 < 1); 400#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 401#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 409#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 422#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 421#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 419#L372-3 assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; 402#L372-6 call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 403#L374 assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; 413#L369-3 cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; 410#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 412#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 404#L372-5 [2021-12-15 17:05:49,540 INFO L793 eck$LassoCheckResult]: Loop: 404#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 405#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 414#L372-3 assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; 404#L372-5 [2021-12-15 17:05:49,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:49,540 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2021-12-15 17:05:49,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:49,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660611698] [2021-12-15 17:05:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:49,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:49,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:49,565 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2021-12-15 17:05:49,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:49,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799966891] [2021-12-15 17:05:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:49,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:49,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:49,572 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:49,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2021-12-15 17:05:49,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:49,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551397131] [2021-12-15 17:05:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:49,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:49,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:49,596 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:50,315 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:05:50,315 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:05:50,315 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:05:50,315 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:05:50,315 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:05:50,315 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:50,315 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:05:50,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:05:50,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration5_Lasso [2021-12-15 17:05:50,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:05:50,315 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:05:50,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:50,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:05:51,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:05:51,793 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:05:51,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:51,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:51,795 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:51,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-15 17:05:51,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:51,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:51,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:51,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:51,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:51,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:51,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:51,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:51,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-15 17:05:51,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:51,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:51,822 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:51,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-15 17:05:51,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:51,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:51,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:51,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:51,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:51,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:51,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:51,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:51,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:51,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-15 17:05:51,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:51,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:51,847 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:51,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-15 17:05:51,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:51,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:51,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:51,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:51,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:51,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:51,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:51,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:51,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:51,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:51,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:51,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:51,879 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:51,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-15 17:05:51,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:51,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:51,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:05:51,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:51,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:51,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:51,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:05:51,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:05:51,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:51,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:51,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:51,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:51,904 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:51,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-15 17:05:51,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:51,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:51,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:51,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:51,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:51,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:51,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:51,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:51,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-15 17:05:51,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:51,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:51,940 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:51,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-15 17:05:51,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:51,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:51,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:51,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:51,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:51,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:51,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:51,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:51,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:51,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:51,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:51,968 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:51,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-15 17:05:51,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:51,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:51,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:51,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:51,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:51,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:51,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:51,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:52,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-15 17:05:52,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:52,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:52,005 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:52,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-15 17:05:52,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:52,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:52,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:52,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:52,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:52,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:52,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:52,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:05:52,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-15 17:05:52,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:52,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:52,045 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:52,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-15 17:05:52,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:05:52,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:05:52,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:05:52,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:05:52,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:05:52,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:05:52,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:05:52,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:05:52,094 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 17:05:52,094 INFO L444 ModelExtractionUtils]: 14 out of 37 variables were initially zero. Simplification set additionally 20 variables to zero. [2021-12-15 17:05:52,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:05:52,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:52,095 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:05:52,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-15 17:05:52,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:05:52,131 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:05:52,132 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:05:52,132 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3, ULTIMATE.start_cstrspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0#1.offset Supporting invariants [] [2021-12-15 17:05:52,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-15 17:05:52,213 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2021-12-15 17:05:52,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:52,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:05:52,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:52,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:05:52,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:52,326 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-15 17:05:52,326 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:52,354 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 6 states. [2021-12-15 17:05:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:05:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2021-12-15 17:05:52,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2021-12-15 17:05:52,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:52,356 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:05:52,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:52,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:05:52,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:52,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:05:52,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:52,473 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-15 17:05:52,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:52,501 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 6 states. [2021-12-15 17:05:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:05:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2021-12-15 17:05:52,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2021-12-15 17:05:52,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:52,503 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:05:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:52,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:05:52,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:52,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:05:52,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:52,618 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-15 17:05:52,618 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:52,648 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 53 transitions. Complement of second has 5 states. [2021-12-15 17:05:52,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:05:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2021-12-15 17:05:52,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2021-12-15 17:05:52,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:52,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2021-12-15 17:05:52,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:52,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2021-12-15 17:05:52,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:05:52,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2021-12-15 17:05:52,651 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:05:52,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2021-12-15 17:05:52,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-15 17:05:52,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-15 17:05:52,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-15 17:05:52,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:05:52,652 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:05:52,652 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:05:52,652 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:05:52,652 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:05:52,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-15 17:05:52,652 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:05:52,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-15 17:05:52,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:05:52 BoogieIcfgContainer [2021-12-15 17:05:52,657 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:05:52,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:05:52,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:05:52,658 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:05:52,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:05:44" (3/4) ... [2021-12-15 17:05:52,661 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 17:05:52,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:05:52,661 INFO L158 Benchmark]: Toolchain (without parser) took 9022.63ms. Allocated memory was 94.4MB in the beginning and 148.9MB in the end (delta: 54.5MB). Free memory was 64.3MB in the beginning and 42.3MB in the end (delta: 22.0MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2021-12-15 17:05:52,661 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:05:52,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.17ms. Allocated memory was 94.4MB in the beginning and 123.7MB in the end (delta: 29.4MB). Free memory was 64.3MB in the beginning and 91.6MB in the end (delta: -27.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-15 17:05:52,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.74ms. Allocated memory is still 123.7MB. Free memory was 91.1MB in the beginning and 89.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:05:52,662 INFO L158 Benchmark]: Boogie Preprocessor took 20.71ms. Allocated memory is still 123.7MB. Free memory was 89.5MB in the beginning and 88.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:05:52,662 INFO L158 Benchmark]: RCFGBuilder took 283.81ms. Allocated memory is still 123.7MB. Free memory was 88.0MB in the beginning and 76.0MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:05:52,663 INFO L158 Benchmark]: BuchiAutomizer took 8312.36ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 76.0MB in the beginning and 42.3MB in the end (delta: 33.7MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2021-12-15 17:05:52,663 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 148.9MB. Free memory is still 42.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:05:52,668 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.17ms. Allocated memory was 94.4MB in the beginning and 123.7MB in the end (delta: 29.4MB). Free memory was 64.3MB in the beginning and 91.6MB in the end (delta: -27.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.74ms. Allocated memory is still 123.7MB. Free memory was 91.1MB in the beginning and 89.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.71ms. Allocated memory is still 123.7MB. Free memory was 89.5MB in the beginning and 88.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 283.81ms. Allocated memory is still 123.7MB. Free memory was 88.0MB in the beginning and 76.0MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 8312.36ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 76.0MB in the beginning and 42.3MB in the end (delta: 33.7MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 148.9MB. Free memory is still 42.3MB. There was no memory consumed. Max. memory is 16.1GB. * 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[nondetString1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString2] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 105 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital262 mio100 ax100 hnf100 lsp107 ukn79 mio100 lsp31 div134 bol100 ite100 ukn100 eq162 hnf77 smp87 dnf761 smp35 tf100 neg95 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 120ms 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! [2021-12-15 17:05:52,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-15 17:05:52,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE