./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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-memory-alloca/diff-alloca-1.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 7d91838293b2ae7cb3f7f9efd98a90268dc3919932b26265bdec6e6111b9d2cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:28:11,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:28:11,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:28:11,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:28:11,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:28:11,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:28:11,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:28:11,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:28:11,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:28:11,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:28:11,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:28:11,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:28:11,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:28:11,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:28:11,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:28:11,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:28:11,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:28:11,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:28:11,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:28:11,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:28:11,329 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:28:11,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:28:11,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:28:11,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:28:11,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:28:11,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:28:11,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:28:11,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:28:11,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:28:11,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:28:11,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:28:11,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:28:11,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:28:11,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:28:11,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:28:11,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:28:11,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:28:11,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:28:11,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:28:11,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:28:11,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:28:11,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:28:11,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-23 14:28:11,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:28:11,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:28:11,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:28:11,387 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:28:11,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:28:11,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:28:11,389 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:28:11,389 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:28:11,390 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:28:11,390 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:28:11,390 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:28:11,391 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:28:11,391 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:28:11,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:28:11,391 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:28:11,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:28:11,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:28:11,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:28:11,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:28:11,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:28:11,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:28:11,393 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:28:11,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:28:11,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:28:11,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:28:11,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:28:11,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:28:11,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:28:11,397 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:28:11,397 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 -> 7d91838293b2ae7cb3f7f9efd98a90268dc3919932b26265bdec6e6111b9d2cf [2022-07-23 14:28:11,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:28:11,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:28:11,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:28:11,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:28:11,625 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:28:11,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2022-07-23 14:28:11,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176270b45/2863c921b4764b269b84341c58509926/FLAGe1571a79d [2022-07-23 14:28:12,175 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:28:12,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2022-07-23 14:28:12,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176270b45/2863c921b4764b269b84341c58509926/FLAGe1571a79d [2022-07-23 14:28:12,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176270b45/2863c921b4764b269b84341c58509926 [2022-07-23 14:28:12,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:28:12,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:28:12,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:28:12,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:28:12,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:28:12,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af9ca53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12, skipping insertion in model container [2022-07-23 14:28:12,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:28:12,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:28:12,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:28:12,557 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:28:12,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:28:12,632 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:28:12,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12 WrapperNode [2022-07-23 14:28:12,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:28:12,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:28:12,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:28:12,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:28:12,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,668 INFO L137 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2022-07-23 14:28:12,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:28:12,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:28:12,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:28:12,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:28:12,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:28:12,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:28:12,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:28:12,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:28:12,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (1/1) ... [2022-07-23 14:28:12,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:12,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:12,741 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) [2022-07-23 14:28:12,772 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 [2022-07-23 14:28:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:28:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:28:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:28:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:28:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:28:12,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:28:12,915 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:28:12,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:28:13,092 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:28:13,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:28:13,096 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 14:28:13,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:28:13 BoogieIcfgContainer [2022-07-23 14:28:13,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:28:13,098 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:28:13,098 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:28:13,112 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:28:13,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:28:13,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:28:12" (1/3) ... [2022-07-23 14:28:13,114 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20d066f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:28:13, skipping insertion in model container [2022-07-23 14:28:13,114 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:28:13,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:12" (2/3) ... [2022-07-23 14:28:13,114 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20d066f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:28:13, skipping insertion in model container [2022-07-23 14:28:13,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:28:13,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:28:13" (3/3) ... [2022-07-23 14:28:13,116 INFO L354 chiAutomizerObserver]: Analyzing ICFG diff-alloca-1.i [2022-07-23 14:28:13,163 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:28:13,164 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:28:13,164 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:28:13,164 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:28:13,164 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:28:13,164 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:28:13,164 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:28:13,164 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:28:13,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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) [2022-07-23 14:28:13,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:28:13,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:13,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:13,191 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 14:28:13,191 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:28:13,191 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:28:13,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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) [2022-07-23 14:28:13,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:28:13,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:13,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:13,195 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 14:28:13,195 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:28:13,200 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 14#L574true assume !(main_~Alen~0#1 < 1); 8#L574-2true assume !(main_~Blen~0#1 < 1); 12#L577-1true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 13#L554-2true [2022-07-23 14:28:13,202 INFO L754 eck$LassoCheckResult]: Loop: 13#L554-2true assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 9#L558-2true assume !true; 5#L557-2true assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; 6#L564-1true diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 13#L554-2true [2022-07-23 14:28:13,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,211 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-23 14:28:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119496772] [2022-07-23 14:28:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:13,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2022-07-23 14:28:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353472751] [2022-07-23 14:28:13,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:13,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:28:13,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353472751] [2022-07-23 14:28:13,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353472751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:28:13,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:28:13,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 14:28:13,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134067496] [2022-07-23 14:28:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:28:13,399 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:28:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:28:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 14:28:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 14:28:13,423 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2022-07-23 14:28:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:28:13,428 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-07-23 14:28:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 14:28:13,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-07-23 14:28:13,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:28:13,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2022-07-23 14:28:13,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-23 14:28:13,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-23 14:28:13,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2022-07-23 14:28:13,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:28:13,441 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2022-07-23 14:28:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2022-07-23 14:28:13,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-23 14:28:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 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) [2022-07-23 14:28:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2022-07-23 14:28:13,458 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2022-07-23 14:28:13,458 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2022-07-23 14:28:13,458 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:28:13,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2022-07-23 14:28:13,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:28:13,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:13,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:13,459 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 14:28:13,459 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:28:13,460 INFO L752 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 45#L574 assume !(main_~Alen~0#1 < 1); 44#L574-2 assume !(main_~Blen~0#1 < 1); 43#L577-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 42#L554-2 [2022-07-23 14:28:13,460 INFO L754 eck$LassoCheckResult]: Loop: 42#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 41#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 38#L557-2 assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; 39#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 42#L554-2 [2022-07-23 14:28:13,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2022-07-23 14:28:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888686783] [2022-07-23 14:28:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,489 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2022-07-23 14:28:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255983558] [2022-07-23 14:28:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2022-07-23 14:28:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007599403] [2022-07-23 14:28:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:13,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:28:13,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007599403] [2022-07-23 14:28:13,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007599403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:28:13,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:28:13,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:28:13,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807271326] [2022-07-23 14:28:13,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:28:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:28:13,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:28:13,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:28:13,788 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-07-23 14:28:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:28:13,827 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2022-07-23 14:28:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:28:13,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2022-07-23 14:28:13,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-23 14:28:13,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2022-07-23 14:28:13,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-23 14:28:13,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-23 14:28:13,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2022-07-23 14:28:13,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:28:13,830 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12 states and 18 transitions. [2022-07-23 14:28:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2022-07-23 14:28:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-07-23 14:28:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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) [2022-07-23 14:28:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2022-07-23 14:28:13,832 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2022-07-23 14:28:13,832 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2022-07-23 14:28:13,832 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:28:13,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2022-07-23 14:28:13,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-23 14:28:13,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:13,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:13,833 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 14:28:13,833 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:28:13,833 INFO L752 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 73#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 82#L574 assume !(main_~Alen~0#1 < 1); 81#L574-2 assume !(main_~Blen~0#1 < 1); 79#L577-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 78#L554-2 [2022-07-23 14:28:13,833 INFO L754 eck$LassoCheckResult]: Loop: 78#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 80#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 74#L558 assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; 75#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 76#L557-2 assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; 77#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 78#L554-2 [2022-07-23 14:28:13,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,834 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2022-07-23 14:28:13,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801097888] [2022-07-23 14:28:13,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2022-07-23 14:28:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14984217] [2022-07-23 14:28:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:13,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:28:13,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14984217] [2022-07-23 14:28:13,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14984217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:28:13,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:28:13,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:28:13,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047255156] [2022-07-23 14:28:13,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:28:13,879 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:28:13,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:28:13,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:28:13,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:28:13,880 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2022-07-23 14:28:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:28:13,905 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-07-23 14:28:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:28:13,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2022-07-23 14:28:13,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-23 14:28:13,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2022-07-23 14:28:13,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 14:28:13,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 14:28:13,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2022-07-23 14:28:13,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:28:13,907 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-07-23 14:28:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2022-07-23 14:28:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2022-07-23 14:28:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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) [2022-07-23 14:28:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-07-23 14:28:13,909 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-07-23 14:28:13,909 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-07-23 14:28:13,909 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:28:13,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-07-23 14:28:13,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 14:28:13,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:13,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:13,910 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 14:28:13,910 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:28:13,910 INFO L752 eck$LassoCheckResult]: Stem: 109#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 120#L574 assume !(main_~Alen~0#1 < 1); 119#L574-2 assume !(main_~Blen~0#1 < 1); 117#L577-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 116#L554-2 [2022-07-23 14:28:13,910 INFO L754 eck$LassoCheckResult]: Loop: 116#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 118#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 111#L558 assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; 112#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 114#L557-2 assume !(0 == diff_~found~0#1); 115#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 116#L554-2 [2022-07-23 14:28:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2022-07-23 14:28:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909238018] [2022-07-23 14:28:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,923 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2022-07-23 14:28:13,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467057620] [2022-07-23 14:28:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2022-07-23 14:28:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:13,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706622882] [2022-07-23 14:28:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:13,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:14,899 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:28:14,899 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:28:14,899 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:28:14,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:28:14,904 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:28:14,904 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:14,904 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:28:14,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:28:14,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration4_Lasso [2022-07-23 14:28:14,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:28:14,905 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:28:14,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:14,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:14,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:14,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:15,772 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:28:15,784 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:28:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:15,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:15,797 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) [2022-07-23 14:28:15,825 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 [2022-07-23 14:28:15,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:15,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:15,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:15,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:15,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:15,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:15,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:15,838 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 [2022-07-23 14:28:15,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:15,891 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 [2022-07-23 14:28:15,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:15,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:15,912 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) [2022-07-23 14:28:15,947 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 [2022-07-23 14:28:15,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:15,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:15,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:15,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:15,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:15,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:15,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:15,959 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 [2022-07-23 14:28:15,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:15,988 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 [2022-07-23 14:28:15,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:15,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:15,990 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) [2022-07-23 14:28:15,992 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 [2022-07-23 14:28:15,993 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 [2022-07-23 14:28:16,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:16,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:16,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:16,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:16,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:16,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:16,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:16,067 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 [2022-07-23 14:28:16,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:16,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:16,069 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) [2022-07-23 14:28:16,070 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 [2022-07-23 14:28:16,072 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 [2022-07-23 14:28:16,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:16,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:16,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:16,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:16,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:16,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:16,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:16,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:16,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:16,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:16,121 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) [2022-07-23 14:28:16,125 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 [2022-07-23 14:28:16,126 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 [2022-07-23 14:28:16,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:16,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:16,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:16,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:16,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:16,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:16,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:16,182 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 [2022-07-23 14:28:16,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:16,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:16,184 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) [2022-07-23 14:28:16,196 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 [2022-07-23 14:28:16,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:16,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:16,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:16,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:16,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:16,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:16,212 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 [2022-07-23 14:28:16,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:16,258 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 [2022-07-23 14:28:16,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:16,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:16,260 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) [2022-07-23 14:28:16,261 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 [2022-07-23 14:28:16,263 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 [2022-07-23 14:28:16,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:16,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:16,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:16,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:16,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:16,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:16,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:16,325 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 [2022-07-23 14:28:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:16,336 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) [2022-07-23 14:28:16,348 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 [2022-07-23 14:28:16,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:16,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:16,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:16,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:16,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:16,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:16,375 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 [2022-07-23 14:28:16,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:28:16,438 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-23 14:28:16,438 INFO L444 ModelExtractionUtils]: 26 out of 40 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-23 14:28:16,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:16,487 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) [2022-07-23 14:28:16,509 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 [2022-07-23 14:28:16,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:28:16,532 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 14:28:16,532 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:28:16,532 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_diff_~A#1.base)_1, ULTIMATE.start_diff_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_diff_~A#1.base)_1 - 2*ULTIMATE.start_diff_~i~0#1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_diff_~A#1.base)_1 - 2*ULTIMATE.start_diff_~l1~0#1 >= 0] [2022-07-23 14:28:16,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-23 14:28:16,639 INFO L293 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2022-07-23 14:28:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:16,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 14:28:16,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:16,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:28:16,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 14:28:16,746 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 [2022-07-23 14:28:16,746 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-07-23 14:28:16,790 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 30 transitions. Complement of second has 5 states. [2022-07-23 14:28:16,791 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 [2022-07-23 14:28:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-07-23 14:28:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-07-23 14:28:16,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 5 letters. Loop has 6 letters. [2022-07-23 14:28:16,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:16,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-23 14:28:16,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:16,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 5 letters. Loop has 12 letters. [2022-07-23 14:28:16,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:16,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2022-07-23 14:28:16,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:28:16,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2022-07-23 14:28:16,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-23 14:28:16,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-23 14:28:16,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2022-07-23 14:28:16,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:28:16,795 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-07-23 14:28:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2022-07-23 14:28:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-07-23 14:28:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 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) [2022-07-23 14:28:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2022-07-23 14:28:16,797 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2022-07-23 14:28:16,797 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2022-07-23 14:28:16,797 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:28:16,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2022-07-23 14:28:16,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:28:16,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:16,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:16,797 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:28:16,797 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:28:16,798 INFO L752 eck$LassoCheckResult]: Stem: 268#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 269#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 282#L574 assume !(main_~Alen~0#1 < 1); 281#L574-2 assume !(main_~Blen~0#1 < 1); 278#L577-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 279#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 271#L558-2 [2022-07-23 14:28:16,798 INFO L754 eck$LassoCheckResult]: Loop: 271#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 270#L558 assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1; 271#L558-2 [2022-07-23 14:28:16,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2022-07-23 14:28:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:16,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075254410] [2022-07-23 14:28:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:16,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:16,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:16,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2022-07-23 14:28:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:16,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709090009] [2022-07-23 14:28:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:16,852 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:16,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2022-07-23 14:28:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:16,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113733878] [2022-07-23 14:28:16,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:16,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:16,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:16,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:17,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:17,561 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:28:17,561 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:28:17,561 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:28:17,561 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:28:17,561 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:28:17,561 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:17,561 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:28:17,561 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:28:17,561 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration5_Lasso [2022-07-23 14:28:17,561 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:28:17,561 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:28:17,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:17,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:18,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:18,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:18,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:18,443 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:28:18,444 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:28:18,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,460 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) [2022-07-23 14:28:18,463 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 [2022-07-23 14:28:18,463 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 [2022-07-23 14:28:18,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:18,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:18,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,507 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 [2022-07-23 14:28:18,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,510 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) [2022-07-23 14:28:18,511 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 [2022-07-23 14:28:18,513 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 [2022-07-23 14:28:18,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:18,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:18,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:18,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,537 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 [2022-07-23 14:28:18,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,539 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) [2022-07-23 14:28:18,541 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 [2022-07-23 14:28:18,541 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 [2022-07-23 14:28:18,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:18,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:18,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:18,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,575 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) [2022-07-23 14:28:18,576 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 [2022-07-23 14:28:18,578 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 [2022-07-23 14:28:18,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:18,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:18,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:18,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,609 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) [2022-07-23 14:28:18,610 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 [2022-07-23 14:28:18,610 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 [2022-07-23 14:28:18,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:18,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:18,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:18,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,650 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) [2022-07-23 14:28:18,652 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 [2022-07-23 14:28:18,654 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 [2022-07-23 14:28:18,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:18,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:18,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,711 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 [2022-07-23 14:28:18,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,712 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) [2022-07-23 14:28:18,713 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 [2022-07-23 14:28:18,715 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 [2022-07-23 14:28:18,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:18,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:18,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:18,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,744 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 [2022-07-23 14:28:18,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,745 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) [2022-07-23 14:28:18,758 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 [2022-07-23 14:28:18,759 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 [2022-07-23 14:28:18,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:18,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:18,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,809 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) [2022-07-23 14:28:18,813 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 [2022-07-23 14:28:18,814 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 [2022-07-23 14:28:18,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:18,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:18,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:18,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,843 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 [2022-07-23 14:28:18,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,845 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) [2022-07-23 14:28:18,848 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 [2022-07-23 14:28:18,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 [2022-07-23 14:28:18,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:18,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:18,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:18,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,875 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 [2022-07-23 14:28:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,876 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) [2022-07-23 14:28:18,877 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 [2022-07-23 14:28:18,915 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 [2022-07-23 14:28:18,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:18,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,922 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:28:18,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,922 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:28:18,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:18,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,943 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 [2022-07-23 14:28:18,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,944 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) [2022-07-23 14:28:18,946 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 [2022-07-23 14:28:18,946 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 [2022-07-23 14:28:18,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:18,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:18,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:18,973 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 [2022-07-23 14:28:18,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:18,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:18,975 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) [2022-07-23 14:28:18,975 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 [2022-07-23 14:28:18,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 [2022-07-23 14:28:18,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:18,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:18,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:18,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:18,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:18,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:19,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:19,024 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 [2022-07-23 14:28:19,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:19,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:19,025 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) [2022-07-23 14:28:19,027 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 [2022-07-23 14:28:19,028 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 [2022-07-23 14:28:19,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:19,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:19,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:19,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:19,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:19,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:19,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:19,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:19,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:19,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:19,087 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) [2022-07-23 14:28:19,088 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 [2022-07-23 14:28:19,089 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 [2022-07-23 14:28:19,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:19,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:19,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:19,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:19,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:19,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:19,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:19,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:19,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:19,141 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) [2022-07-23 14:28:19,143 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 [2022-07-23 14:28:19,143 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 [2022-07-23 14:28:19,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:19,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:19,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:19,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:19,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:19,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:19,217 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:28:19,255 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-07-23 14:28:19,255 INFO L444 ModelExtractionUtils]: 24 out of 73 variables were initially zero. Simplification set additionally 46 variables to zero. [2022-07-23 14:28:19,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:19,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:19,256 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) [2022-07-23 14:28:19,257 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 [2022-07-23 14:28:19,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:28:19,280 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:28:19,280 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:28:19,280 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0#1, ULTIMATE.start_diff_~l2~0#1) = -1*ULTIMATE.start_diff_~j~0#1 + 1*ULTIMATE.start_diff_~l2~0#1 Supporting invariants [] [2022-07-23 14:28:19,301 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 [2022-07-23 14:28:19,333 INFO L293 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2022-07-23 14:28:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:19,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:28:19,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:19,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 14:28:19,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:19,395 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 [2022-07-23 14:28:19,395 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-07-23 14:28:19,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 38 states and 53 transitions. Complement of second has 7 states. [2022-07-23 14:28:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:28:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-07-23 14:28:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-07-23 14:28:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-23 14:28:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-23 14:28:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-23 14:28:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:19,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2022-07-23 14:28:19,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:28:19,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2022-07-23 14:28:19,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-23 14:28:19,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-23 14:28:19,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2022-07-23 14:28:19,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:28:19,413 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 39 transitions. [2022-07-23 14:28:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2022-07-23 14:28:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-07-23 14:28:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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) [2022-07-23 14:28:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-07-23 14:28:19,415 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-23 14:28:19,416 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-23 14:28:19,416 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:28:19,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-07-23 14:28:19,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:28:19,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:19,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:19,417 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:28:19,417 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:28:19,417 INFO L752 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 431#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 444#L574 assume !(main_~Alen~0#1 < 1); 443#L574-2 assume !(main_~Blen~0#1 < 1); 438#L577-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 439#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 441#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 449#L558 assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1; 448#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 445#L557-2 assume !(0 == diff_~found~0#1); 437#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 440#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 433#L558-2 [2022-07-23 14:28:19,417 INFO L754 eck$LassoCheckResult]: Loop: 433#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 432#L558 assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1; 433#L558-2 [2022-07-23 14:28:19,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2022-07-23 14:28:19,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:19,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232801462] [2022-07-23 14:28:19,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:19,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 14:28:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:28:19,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232801462] [2022-07-23 14:28:19,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232801462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:28:19,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:28:19,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:28:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748962960] [2022-07-23 14:28:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:28:19,437 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:28:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2022-07-23 14:28:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:19,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126305728] [2022-07-23 14:28:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:19,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:19,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:28:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:28:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:28:19,499 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-07-23 14:28:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:28:19,507 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-07-23 14:28:19,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:28:19,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2022-07-23 14:28:19,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:28:19,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2022-07-23 14:28:19,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-23 14:28:19,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-23 14:28:19,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2022-07-23 14:28:19,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:28:19,509 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-07-23 14:28:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2022-07-23 14:28:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-23 14:28:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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) [2022-07-23 14:28:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-07-23 14:28:19,511 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-23 14:28:19,511 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-23 14:28:19,511 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:28:19,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2022-07-23 14:28:19,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:28:19,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:19,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:19,512 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:28:19,512 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:28:19,513 INFO L752 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 493#L574 assume !(main_~Alen~0#1 < 1); 491#L574-2 assume !(main_~Blen~0#1 < 1); 486#L577-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 487#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 489#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 497#L558 assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; 496#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 484#L557-2 assume !(0 == diff_~found~0#1); 485#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 488#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 481#L558-2 [2022-07-23 14:28:19,513 INFO L754 eck$LassoCheckResult]: Loop: 481#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 480#L558 assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1; 481#L558-2 [2022-07-23 14:28:19,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:19,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2022-07-23 14:28:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:19,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294052052] [2022-07-23 14:28:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:19,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:19,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2022-07-23 14:28:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:19,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51944806] [2022-07-23 14:28:19,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:19,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:19,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2022-07-23 14:28:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:19,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015894743] [2022-07-23 14:28:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:19,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:19,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:19,766 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 [2022-07-23 14:28:20,272 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:28:20,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:28:20,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:28:20,272 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:28:20,273 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:28:20,273 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:20,273 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:28:20,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:28:20,273 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration7_Lasso [2022-07-23 14:28:20,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:28:20,273 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:28:20,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:20,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:21,196 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:28:21,196 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:28:21,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:21,198 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) [2022-07-23 14:28:21,199 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 [2022-07-23 14:28:21,200 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 [2022-07-23 14:28:21,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:21,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:21,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:21,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:21,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:21,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:21,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:21,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:21,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:21,232 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) [2022-07-23 14:28:21,234 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 [2022-07-23 14:28:21,234 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 [2022-07-23 14:28:21,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:21,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:21,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:21,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:21,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:21,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:21,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:21,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-23 14:28:21,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:21,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:21,262 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) [2022-07-23 14:28:21,263 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 [2022-07-23 14:28:21,263 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 [2022-07-23 14:28:21,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:21,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:21,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:21,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:21,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:21,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:21,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:21,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:21,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:21,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:21,289 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) [2022-07-23 14:28:21,290 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 [2022-07-23 14:28:21,291 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 [2022-07-23 14:28:21,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:21,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:21,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:21,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:21,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:21,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:21,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:21,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:21,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:21,332 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) [2022-07-23 14:28:21,334 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 [2022-07-23 14:28:21,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 [2022-07-23 14:28:21,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:21,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:21,341 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:28:21,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:21,345 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-23 14:28:21,345 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-23 14:28:21,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:21,392 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 [2022-07-23 14:28:21,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:21,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:21,393 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) [2022-07-23 14:28:21,394 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 [2022-07-23 14:28:21,395 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 [2022-07-23 14:28:21,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:21,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:21,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:21,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:21,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:21,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:21,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:21,446 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 [2022-07-23 14:28:21,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:21,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:21,448 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2022-07-23 14:28:21,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-23 14:28:21,450 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 [2022-07-23 14:28:21,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:21,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:21,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:21,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:21,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:21,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:21,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:21,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:21,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:21,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:21,478 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2022-07-23 14:28:21,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-23 14:28:21,486 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 [2022-07-23 14:28:21,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:21,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:21,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:21,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:21,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:21,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:21,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:28:21,564 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2022-07-23 14:28:21,564 INFO L444 ModelExtractionUtils]: 21 out of 67 variables were initially zero. Simplification set additionally 43 variables to zero. [2022-07-23 14:28:21,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:21,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:21,566 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2022-07-23 14:28:21,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-23 14:28:21,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:28:21,588 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:28:21,588 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:28:21,588 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0#1, v_rep(select #length ULTIMATE.start_diff_~B#1.base)_3) = -8*ULTIMATE.start_diff_~j~0#1 + 3*v_rep(select #length ULTIMATE.start_diff_~B#1.base)_3 Supporting invariants [] [2022-07-23 14:28:21,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:21,669 INFO L293 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2022-07-23 14:28:21,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:21,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 14:28:21,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:21,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:28:21,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:21,814 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-23 14:28:21,814 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-23 14:28:21,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 20 states and 28 transitions. Complement of second has 4 states. [2022-07-23 14:28:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-23 14:28:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-23 14:28:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-07-23 14:28:21,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-23 14:28:21,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:21,832 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:28:21,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:21,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 14:28:21,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:21,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:28:21,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:21,975 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-23 14:28:21,975 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-23 14:28:21,992 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 20 states and 28 transitions. Complement of second has 4 states. [2022-07-23 14:28:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-23 14:28:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-23 14:28:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-07-23 14:28:21,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-23 14:28:21,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:21,996 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:28:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:22,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 14:28:22,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:22,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:28:22,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:22,118 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-23 14:28:22,118 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-23 14:28:22,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 45 states and 58 transitions. Complement of second has 10 states. [2022-07-23 14:28:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2022-07-23 14:28:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-23 14:28:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-07-23 14:28:22,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-23 14:28:22,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:22,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 14 letters. Loop has 2 letters. [2022-07-23 14:28:22,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:22,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-23 14:28:22,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:22,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-07-23 14:28:22,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:28:22,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 36 states and 47 transitions. [2022-07-23 14:28:22,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-23 14:28:22,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-23 14:28:22,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2022-07-23 14:28:22,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:28:22,179 INFO L369 hiAutomatonCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-23 14:28:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2022-07-23 14:28:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-07-23 14:28:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 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) [2022-07-23 14:28:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-07-23 14:28:22,181 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-07-23 14:28:22,181 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-07-23 14:28:22,182 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:28:22,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. [2022-07-23 14:28:22,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:28:22,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:22,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:22,183 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-23 14:28:22,183 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:28:22,183 INFO L752 eck$LassoCheckResult]: Stem: 839#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 840#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 855#L574 assume !(main_~Alen~0#1 < 1); 854#L574-2 assume !(main_~Blen~0#1 < 1); 848#L577-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 849#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 850#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 861#L558 assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; 863#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 859#L557-2 assume !(0 == diff_~found~0#1); 857#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 851#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 852#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 866#L558 assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; 853#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 845#L557-2 assume !(0 == diff_~found~0#1); 846#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 847#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 842#L558-2 [2022-07-23 14:28:22,183 INFO L754 eck$LassoCheckResult]: Loop: 842#L558-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 841#L558 assume !(diff_#t~mem2#1 == diff_#t~mem3#1);havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_#t~post4#1 := diff_~j~0#1;diff_~j~0#1 := 1 + diff_#t~post4#1;havoc diff_#t~post4#1; 842#L558-2 [2022-07-23 14:28:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1879787962, now seen corresponding path program 3 times [2022-07-23 14:28:22,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:22,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335228888] [2022-07-23 14:28:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:22,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:22,197 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:22,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 4 times [2022-07-23 14:28:22,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:22,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486193136] [2022-07-23 14:28:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:22,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:22,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:22,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1705001195, now seen corresponding path program 2 times [2022-07-23 14:28:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:22,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940831595] [2022-07-23 14:28:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:22,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:22,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:22,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:23,270 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:28:23,270 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:28:23,270 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:28:23,271 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:28:23,271 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:28:23,271 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:23,271 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:28:23,271 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:28:23,279 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration8_Lasso [2022-07-23 14:28:23,279 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:28:23,279 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:28:23,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:23,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:24,237 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:28:24,237 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:28:24,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:24,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:24,238 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2022-07-23 14:28:24,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-23 14:28:24,241 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 [2022-07-23 14:28:24,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:24,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:24,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:24,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:24,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:24,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:24,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:24,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:24,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:24,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:24,272 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2022-07-23 14:28:24,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-23 14:28:24,278 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 [2022-07-23 14:28:24,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:24,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:24,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:24,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:24,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:24,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:24,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:24,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:24,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-23 14:28:24,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:24,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:24,303 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2022-07-23 14:28:24,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-23 14:28:24,305 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 [2022-07-23 14:28:24,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:24,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:24,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:24,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:24,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:24,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:24,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:24,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:24,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-23 14:28:24,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:24,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:24,330 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2022-07-23 14:28:24,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-23 14:28:24,333 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 [2022-07-23 14:28:24,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:24,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:24,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:24,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:24,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:24,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:24,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:24,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:24,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:24,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:24,358 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2022-07-23 14:28:24,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-23 14:28:24,360 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 [2022-07-23 14:28:24,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:24,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:24,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:24,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:24,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:24,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:24,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:24,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:24,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:24,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:24,387 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2022-07-23 14:28:24,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-23 14:28:24,389 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 [2022-07-23 14:28:24,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:24,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:24,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:24,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:24,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:24,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:24,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:24,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:24,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:24,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:24,416 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2022-07-23 14:28:24,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-23 14:28:24,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 [2022-07-23 14:28:24,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:24,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:24,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:24,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:24,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:24,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:24,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:28:24,488 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-07-23 14:28:24,489 INFO L444 ModelExtractionUtils]: 42 out of 70 variables were initially zero. Simplification set additionally 25 variables to zero. [2022-07-23 14:28:24,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:24,490 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2022-07-23 14:28:24,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-23 14:28:24,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:28:24,513 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:28:24,513 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:28:24,513 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0#1, ULTIMATE.start_diff_~l2~0#1) = -1*ULTIMATE.start_diff_~j~0#1 + 1*ULTIMATE.start_diff_~l2~0#1 Supporting invariants [] [2022-07-23 14:28:24,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:24,587 INFO L293 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2022-07-23 14:28:24,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:24,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:28:24,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:24,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 14:28:24,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:24,635 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 [2022-07-23 14:28:24,635 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-23 14:28:24,645 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 40 states and 53 transitions. Complement of second has 7 states. [2022-07-23 14:28:24,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:28:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-23 14:28:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-07-23 14:28:24,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 18 letters. Loop has 2 letters. [2022-07-23 14:28:24,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:24,647 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:28:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:24,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:28:24,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:24,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 14:28:24,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:24,696 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:28:24,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-23 14:28:24,704 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 40 states and 53 transitions. Complement of second has 7 states. [2022-07-23 14:28:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:28:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-23 14:28:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-07-23 14:28:24,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 18 letters. Loop has 2 letters. [2022-07-23 14:28:24,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:24,706 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:28:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:24,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:28:24,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:24,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 14:28:24,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:24,745 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:28:24,745 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-23 14:28:24,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 54 states and 74 transitions. Complement of second has 6 states. [2022-07-23 14:28:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:28:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-23 14:28:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-07-23 14:28:24,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 18 letters. Loop has 2 letters. [2022-07-23 14:28:24,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:24,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 2 letters. [2022-07-23 14:28:24,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:24,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 18 letters. Loop has 4 letters. [2022-07-23 14:28:24,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:24,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 74 transitions. [2022-07-23 14:28:24,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:28:24,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2022-07-23 14:28:24,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 14:28:24,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 14:28:24,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 14:28:24,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:28:24,762 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:28:24,762 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:28:24,762 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:28:24,762 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 14:28:24,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 14:28:24,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:28:24,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 14:28:24,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 02:28:24 BoogieIcfgContainer [2022-07-23 14:28:24,767 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 14:28:24,769 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 14:28:24,769 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 14:28:24,769 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 14:28:24,770 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:28:13" (3/4) ... [2022-07-23 14:28:24,772 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 14:28:24,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 14:28:24,776 INFO L158 Benchmark]: Toolchain (without parser) took 12561.60ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 50.4MB in the beginning and 81.2MB in the end (delta: -30.8MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2022-07-23 14:28:24,776 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 42.2MB in the end (delta: 40.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:28:24,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.44ms. Allocated memory is still 83.9MB. Free memory was 50.1MB in the beginning and 53.4MB in the end (delta: -3.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 14:28:24,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.13ms. Allocated memory is still 83.9MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:28:24,777 INFO L158 Benchmark]: Boogie Preprocessor took 42.80ms. Allocated memory is still 83.9MB. Free memory was 51.3MB in the beginning and 50.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:28:24,777 INFO L158 Benchmark]: RCFGBuilder took 384.63ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 38.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 14:28:24,777 INFO L158 Benchmark]: BuchiAutomizer took 11668.63ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 38.7MB in the beginning and 81.2MB in the end (delta: -42.5MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2022-07-23 14:28:24,778 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 176.2MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:28:24,779 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.20ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 42.2MB in the end (delta: 40.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.44ms. Allocated memory is still 83.9MB. Free memory was 50.1MB in the beginning and 53.4MB in the end (delta: -3.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.13ms. Allocated memory is still 83.9MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.80ms. Allocated memory is still 83.9MB. Free memory was 51.3MB in the beginning and 50.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.63ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 38.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 11668.63ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 38.7MB in the beginning and 81.2MB in the end (delta: -42.5MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 176.2MB. Free memory is still 81.2MB. 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 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[A] and consists of 4 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function 3 * unknown-#length-unknown[B] + -8 * j and consists of 7 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.6s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 10.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 156 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital265 mio100 ax106 hnf100 lsp84 ukn92 mio100 lsp53 div100 bol100 ite100 ukn100 eq185 hnf90 smp100 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-23 14:28:24,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:25,036 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