./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-dev-03d7b7b [2022-02-21 03:32:28,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:28,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:28,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:28,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:28,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:28,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:28,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:28,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:28,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:28,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:28,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:28,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:28,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:28,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:28,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:28,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:28,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:28,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:28,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:28,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:28,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:28,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:28,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:28,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:28,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:28,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:28,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:28,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:28,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:28,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:28,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:28,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:28,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:28,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:28,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:28,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:28,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:28,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:28,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:28,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:28,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:28,180 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:28,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:28,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:28,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:28,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:28,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:28,182 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:28,183 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:28,183 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:28,183 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:28,183 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:28,183 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:28,184 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:28,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:28,184 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:28,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:28,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:28,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:28,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:28,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:28,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:28,185 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:28,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:28,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:28,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:28,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:28,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:28,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:28,187 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:28,188 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-02-21 03:32:28,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:28,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:28,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:28,463 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:28,467 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:28,469 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-02-21 03:32:28,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84cc419a/430b02100acd4b99a8a982259557f731/FLAG419ea057b [2022-02-21 03:32:28,973 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:28,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2022-02-21 03:32:28,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84cc419a/430b02100acd4b99a8a982259557f731/FLAG419ea057b [2022-02-21 03:32:29,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84cc419a/430b02100acd4b99a8a982259557f731 [2022-02-21 03:32:29,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:29,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:29,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:29,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:29,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:29,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d4ed46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29, skipping insertion in model container [2022-02-21 03:32:29,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:29,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:29,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:29,716 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:29,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:29,801 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:29,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29 WrapperNode [2022-02-21 03:32:29,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:29,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:29,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:29,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:29,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,870 INFO L137 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2022-02-21 03:32:29,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:29,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:29,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:29,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:29,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:29,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:29,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:29,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:29,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (1/1) ... [2022-02-21 03:32:29,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:29,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:29,936 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-02-21 03:32:29,938 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-02-21 03:32:29,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:29,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:29,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:29,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:29,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:29,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:30,062 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:30,063 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:30,285 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:30,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:30,291 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:32:30,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:30 BoogieIcfgContainer [2022-02-21 03:32:30,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:30,293 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:30,294 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:30,297 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:30,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:30,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:29" (1/3) ... [2022-02-21 03:32:30,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a00539a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:30, skipping insertion in model container [2022-02-21 03:32:30,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:30,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:29" (2/3) ... [2022-02-21 03:32:30,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a00539a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:30, skipping insertion in model container [2022-02-21 03:32:30,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:30,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:30" (3/3) ... [2022-02-21 03:32:30,302 INFO L388 chiAutomizerObserver]: Analyzing ICFG diff-alloca-1.i [2022-02-21 03:32:30,361 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:30,361 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:30,361 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:30,361 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:30,361 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:30,362 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:30,362 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:30,362 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:30,380 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-02-21 03:32:30,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:30,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:30,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:30,417 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:30,418 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:30,418 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:30,419 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-02-21 03:32:30,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:30,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:30,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:30,428 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:30,428 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:30,434 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#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; 15#L574true assume !(main_~Alen~0#1 < 1); 9#L574-2true assume !(main_~Blen~0#1 < 1); 13#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; 14#L554-2true [2022-02-21 03:32:30,436 INFO L793 eck$LassoCheckResult]: Loop: 14#L554-2true assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 10#L558-2true assume !true; 6#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; 7#L564-1true diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 14#L554-2true [2022-02-21 03:32:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:32:30,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:30,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620670594] [2022-02-21 03:32:30,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:30,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:30,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:30,665 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2022-02-21 03:32:30,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:30,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397766694] [2022-02-21 03:32:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:30,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:30,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {20#true} is VALID [2022-02-21 03:32:30,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume !true; {21#false} is VALID [2022-02-21 03:32:30,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#false} 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; {21#false} is VALID [2022-02-21 03:32:30,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#false} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {21#false} is VALID [2022-02-21 03:32:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:30,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:30,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397766694] [2022-02-21 03:32:30,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397766694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:30,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:30,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:32:30,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192881448] [2022-02-21 03:32:30,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:30,777 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:30,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:30,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:32:30,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:32:30,835 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-02-21 03:32:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:30,860 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:32:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:32:30,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:32:30,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:30,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-02-21 03:32:30,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:30,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2022-02-21 03:32:30,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:30,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:32:30,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2022-02-21 03:32:30,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:30,889 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2022-02-21 03:32:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2022-02-21 03:32:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-21 03:32:30,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:30,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 15 transitions. Second 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-02-21 03:32:30,910 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 15 transitions. Second 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-02-21 03:32:30,912 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second 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-02-21 03:32:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:30,914 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2022-02-21 03:32:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2022-02-21 03:32:30,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:30,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:30,916 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 10 states and 15 transitions. [2022-02-21 03:32:30,916 INFO L87 Difference]: Start difference. First 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) Second operand 10 states and 15 transitions. [2022-02-21 03:32:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:30,920 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2022-02-21 03:32:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2022-02-21 03:32:30,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:30,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:30,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:30,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:30,922 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-02-21 03:32:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2022-02-21 03:32:30,927 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2022-02-21 03:32:30,927 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2022-02-21 03:32:30,928 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:30,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2022-02-21 03:32:30,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:30,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:30,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:30,932 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:30,932 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:30,932 INFO L791 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-02-21 03:32:30,933 INFO L793 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-02-21 03:32:30,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2022-02-21 03:32:30,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:30,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242542928] [2022-02-21 03:32:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:30,981 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,006 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:31,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2022-02-21 03:32:31,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:31,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022788359] [2022-02-21 03:32:31,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,034 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,056 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:31,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2022-02-21 03:32:31,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:31,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070116261] [2022-02-21 03:32:31,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:31,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {73#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {73#true} is VALID [2022-02-21 03:32:31,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {73#true} 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; {73#true} is VALID [2022-02-21 03:32:31,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {73#true} assume !(main_~Alen~0#1 < 1); {73#true} is VALID [2022-02-21 03:32:31,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {73#true} assume !(main_~Blen~0#1 < 1); {75#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 03:32:31,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {75#(<= 1 |ULTIMATE.start_main_~Blen~0#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; {76#(<= 1 |ULTIMATE.start_diff_~l2~0#1|)} is VALID [2022-02-21 03:32:31,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {76#(<= 1 |ULTIMATE.start_diff_~l2~0#1|)} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {77#(and (<= 1 |ULTIMATE.start_diff_~l2~0#1|) (= |ULTIMATE.start_diff_~found~0#1| 0) (= |ULTIMATE.start_diff_~j~0#1| 0))} is VALID [2022-02-21 03:32:31,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {77#(and (<= 1 |ULTIMATE.start_diff_~l2~0#1|) (= |ULTIMATE.start_diff_~found~0#1| 0) (= |ULTIMATE.start_diff_~j~0#1| 0))} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {74#false} is VALID [2022-02-21 03:32:31,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {74#false} 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; {74#false} is VALID [2022-02-21 03:32:31,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {74#false} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {74#false} is VALID [2022-02-21 03:32:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:31,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:31,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070116261] [2022-02-21 03:32:31,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070116261] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:31,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:31,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:32:31,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402720706] [2022-02-21 03:32:31,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:31,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:32:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:32:31,403 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-02-21 03:32:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:31,483 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2022-02-21 03:32:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:32:31,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:32:31,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:31,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2022-02-21 03:32:31,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:32:31,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2022-02-21 03:32:31,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:32:31,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:32:31,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2022-02-21 03:32:31,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:31,503 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2022-02-21 03:32:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2022-02-21 03:32:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-02-21 03:32:31,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:31,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 18 transitions. Second 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-02-21 03:32:31,506 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 18 transitions. Second 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-02-21 03:32:31,506 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second 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-02-21 03:32:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:31,507 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2022-02-21 03:32:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2022-02-21 03:32:31,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:31,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:31,508 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 12 states and 18 transitions. [2022-02-21 03:32:31,509 INFO L87 Difference]: Start difference. First 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) Second operand 12 states and 18 transitions. [2022-02-21 03:32:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:31,510 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2022-02-21 03:32:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2022-02-21 03:32:31,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:31,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:31,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:31,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:31,513 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-02-21 03:32:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2022-02-21 03:32:31,515 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2022-02-21 03:32:31,515 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2022-02-21 03:32:31,515 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:31,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2022-02-21 03:32:31,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:32:31,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:31,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:31,517 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:31,517 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:31,518 INFO L791 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 95#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; 104#L574 assume !(main_~Alen~0#1 < 1); 103#L574-2 assume !(main_~Blen~0#1 < 1); 100#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; 101#L554-2 [2022-02-21 03:32:31,518 INFO L793 eck$LassoCheckResult]: Loop: 101#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 102#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); 96#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; 97#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 98#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; 99#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 101#L554-2 [2022-02-21 03:32:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:31,519 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2022-02-21 03:32:31,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:31,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060873197] [2022-02-21 03:32:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,585 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:31,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2022-02-21 03:32:31,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:31,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938127463] [2022-02-21 03:32:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:31,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#true} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {134#true} is VALID [2022-02-21 03:32:31,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} 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); {136#(<= (+ |ULTIMATE.start_diff_~j~0#1| 1) |ULTIMATE.start_diff_~l2~0#1|)} is VALID [2022-02-21 03:32:31,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#(<= (+ |ULTIMATE.start_diff_~j~0#1| 1) |ULTIMATE.start_diff_~l2~0#1|)} assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; {136#(<= (+ |ULTIMATE.start_diff_~j~0#1| 1) |ULTIMATE.start_diff_~l2~0#1|)} is VALID [2022-02-21 03:32:31,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {136#(<= (+ |ULTIMATE.start_diff_~j~0#1| 1) |ULTIMATE.start_diff_~l2~0#1|)} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {137#(not (= |ULTIMATE.start_diff_~found~0#1| 0))} is VALID [2022-02-21 03:32:31,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {137#(not (= |ULTIMATE.start_diff_~found~0#1| 0))} 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; {135#false} is VALID [2022-02-21 03:32:31,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#false} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {135#false} is VALID [2022-02-21 03:32:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:31,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:31,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938127463] [2022-02-21 03:32:31,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938127463] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:31,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:31,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:32:31,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273088342] [2022-02-21 03:32:31,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:31,630 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:31,630 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:32:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:32:31,631 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-02-21 03:32:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:31,695 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 03:32:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:32:31,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:32:31,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:31,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2022-02-21 03:32:31,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-02-21 03:32:31,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2022-02-21 03:32:31,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:32:31,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:32:31,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2022-02-21 03:32:31,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:31,712 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 03:32:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2022-02-21 03:32:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2022-02-21 03:32:31,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:31,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 22 transitions. Second 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-02-21 03:32:31,714 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 22 transitions. Second 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-02-21 03:32:31,714 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second 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-02-21 03:32:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:31,715 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 03:32:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 03:32:31,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:31,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:31,717 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 17 states and 22 transitions. [2022-02-21 03:32:31,717 INFO L87 Difference]: Start difference. First 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) Second operand 17 states and 22 transitions. [2022-02-21 03:32:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:31,718 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 03:32:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 03:32:31,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:31,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:31,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:31,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:31,721 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-02-21 03:32:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 03:32:31,728 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:32:31,728 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:32:31,728 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:32:31,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:32:31,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:32:31,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:31,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:31,730 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:31,730 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:31,730 INFO L791 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 158#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; 168#L574 assume !(main_~Alen~0#1 < 1); 167#L574-2 assume !(main_~Blen~0#1 < 1); 164#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; 165#L554-2 [2022-02-21 03:32:31,730 INFO L793 eck$LassoCheckResult]: Loop: 165#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 166#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); 159#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; 160#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 162#L557-2 assume !(0 == diff_~found~0#1); 163#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 165#L554-2 [2022-02-21 03:32:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:31,731 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2022-02-21 03:32:31,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:31,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072935112] [2022-02-21 03:32:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,764 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,787 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2022-02-21 03:32:31,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:31,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127527007] [2022-02-21 03:32:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,824 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:31,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2022-02-21 03:32:31,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:31,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008878733] [2022-02-21 03:32:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:31,893 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:32,935 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:32,936 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:32,936 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:32,936 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:32,936 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:32,936 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:32,936 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:32,937 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:32,937 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration4_Lasso [2022-02-21 03:32:32,937 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:32,937 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:32,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:32,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:32,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:32,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:34,147 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:34,151 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:34,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,155 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-02-21 03:32:34,160 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-02-21 03:32:34,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,173 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-02-21 03:32:34,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:34,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,197 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-02-21 03:32:34,202 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-02-21 03:32:34,203 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-02-21 03:32:34,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,250 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-02-21 03:32:34,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,252 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-02-21 03:32:34,264 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-02-21 03:32:34,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,278 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-02-21 03:32:34,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,310 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-02-21 03:32:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,312 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-02-21 03:32:34,316 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-02-21 03:32:34,316 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-02-21 03:32:34,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,368 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-02-21 03:32:34,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,370 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-02-21 03:32:34,371 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-02-21 03:32:34,372 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-02-21 03:32:34,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:32:34,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,438 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-02-21 03:32:34,438 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-02-21 03:32:34,439 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-02-21 03:32:34,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,490 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-02-21 03:32:34,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,492 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-02-21 03:32:34,502 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-02-21 03:32:34,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,532 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-02-21 03:32:34,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,583 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-02-21 03:32:34,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,586 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-02-21 03:32:34,592 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-02-21 03:32:34,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:34,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:34,694 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:32:34,694 INFO L444 ModelExtractionUtils]: 26 out of 40 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:32:34,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,698 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-02-21 03:32:34,702 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:34,711 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-02-21 03:32:34,724 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:34,725 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:34,725 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~A#1.offset, ULTIMATE.start_diff_~i~0#1, v_rep(select #length ULTIMATE.start_diff_~A#1.base)_1) = -1*ULTIMATE.start_diff_~A#1.offset - 4*ULTIMATE.start_diff_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_diff_~A#1.base)_1 Supporting invariants [] [2022-02-21 03:32:34,775 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-02-21 03:32:34,888 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2022-02-21 03:32:34,893 INFO L390 LassoCheck]: Loop: "assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0;" "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);" "assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1;" "assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);" "assume !(0 == diff_~found~0#1);" "diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1;" [2022-02-21 03:32:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:34,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:34,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:34,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {213#unseeded} is VALID [2022-02-21 03:32:34,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#unseeded} 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; {213#unseeded} is VALID [2022-02-21 03:32:34,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#unseeded} assume !(main_~Alen~0#1 < 1); {213#unseeded} is VALID [2022-02-21 03:32:34,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {213#unseeded} assume !(main_~Blen~0#1 < 1); {213#unseeded} is VALID [2022-02-21 03:32:34,975 INFO L290 TraceCheckUtils]: 4: Hoare triple {213#unseeded} 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; {213#unseeded} is VALID [2022-02-21 03:32:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:34,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:34,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:35,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {216#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|)))} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {216#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|)))} is VALID [2022-02-21 03:32:35,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|)))} 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); {321#(and (<= (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| 4) (select |#length| |ULTIMATE.start_diff_~A#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|))))} is VALID [2022-02-21 03:32:35,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {321#(and (<= (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| 4) (select |#length| |ULTIMATE.start_diff_~A#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|))))} assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; {321#(and (<= (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| 4) (select |#length| |ULTIMATE.start_diff_~A#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|))))} is VALID [2022-02-21 03:32:35,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {321#(and (<= (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| 4) (select |#length| |ULTIMATE.start_diff_~A#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|))))} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {321#(and (<= (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| 4) (select |#length| |ULTIMATE.start_diff_~A#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|))))} is VALID [2022-02-21 03:32:35,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {321#(and (<= (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| 4) (select |#length| |ULTIMATE.start_diff_~A#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|))))} assume !(0 == diff_~found~0#1); {321#(and (<= (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| 4) (select |#length| |ULTIMATE.start_diff_~A#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|))))} is VALID [2022-02-21 03:32:35,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {321#(and (<= (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| 4) (select |#length| |ULTIMATE.start_diff_~A#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|))))} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {301#(or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_diff_~A#1.base|) (* (- 4) |ULTIMATE.start_diff_~i~0#1|) (* (- 1) |ULTIMATE.start_diff_~A#1.offset|)))) unseeded)} is VALID [2022-02-21 03:32:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:35,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:32:35,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:35,082 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:35,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,085 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-02-21 03:32:35,086 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-02-21 03:32:35,154 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 6 states. [2022-02-21 03:32:35,154 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-02-21 03:32:35,155 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:35,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. cyclomatic complexity: 6 [2022-02-21 03:32:35,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:35,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:35,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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-02-21 03:32:35,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:35,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:35,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:35,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2022-02-21 03:32:35,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:35,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:35,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:35,162 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 6 [2022-02-21 03:32:35,166 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:32:35,166 INFO L70 LassoExtractor]: Start lassoExtractor. 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-02-21 03:32:35,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:35,168 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:35,168 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:35,169 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:35,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:35,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,170 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:35,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:35,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:35,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,172 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:35,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:35,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:35,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,173 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:35,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:35,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:32:35,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,174 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:32:35,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:32:35,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:32:35,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,176 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:32:35,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:32:35,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:35,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,177 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:35,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:35,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:32:35,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,178 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:32:35,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:32:35,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:35,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,179 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:35,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:35,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:32:35,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,182 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:32:35,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:32:35,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:35,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,184 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:35,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:32:35,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:35,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,185 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:35,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:35,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:35,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,186 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:35,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:35,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:32:35,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,188 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:32:35,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:32:35,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:35,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,189 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:35,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:35,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:35,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,190 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:35,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:32:35,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:35,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,191 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:35,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:35,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:35,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:35,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:35,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,192 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:35,193 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-02-21 03:32:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:32:35,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:32:35,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:32:35,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2022-02-21 03:32:35,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:35,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:35,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2022-02-21 03:32:35,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:32:35,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:32:35,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2022-02-21 03:32:35,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:35,201 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 03:32:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2022-02-21 03:32:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 03:32:35,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:35,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 24 transitions. Second 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-02-21 03:32:35,204 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 24 transitions. Second 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-02-21 03:32:35,205 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second 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-02-21 03:32:35,206 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:35,207 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2022-02-21 03:32:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2022-02-21 03:32:35,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:35,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:35,208 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 17 states and 24 transitions. [2022-02-21 03:32:35,208 INFO L87 Difference]: Start difference. First 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) Second operand 17 states and 24 transitions. [2022-02-21 03:32:35,209 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:35,211 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2022-02-21 03:32:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2022-02-21 03:32:35,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:35,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:35,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:35,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:35,212 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-02-21 03:32:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2022-02-21 03:32:35,216 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2022-02-21 03:32:35,216 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2022-02-21 03:32:35,217 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:32:35,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2022-02-21 03:32:35,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:35,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:35,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:35,218 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:35,218 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:35,218 INFO L791 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 365#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; 378#L574 assume !(main_~Alen~0#1 < 1); 377#L574-2 assume !(main_~Blen~0#1 < 1); 374#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; 375#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 367#L558-2 [2022-02-21 03:32:35,218 INFO L793 eck$LassoCheckResult]: Loop: 367#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); 366#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; 367#L558-2 [2022-02-21 03:32:35,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2022-02-21 03:32:35,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:35,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062778495] [2022-02-21 03:32:35,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:35,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,255 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,272 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:35,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2022-02-21 03:32:35,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:35,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178063541] [2022-02-21 03:32:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,294 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2022-02-21 03:32:35,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:35,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663144458] [2022-02-21 03:32:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,318 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,333 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:35,500 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-02-21 03:32:36,137 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:36,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:36,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:36,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:36,138 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:36,138 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:36,138 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:36,138 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:36,138 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration5_Lasso [2022-02-21 03:32:36,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:36,138 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:36,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:37,403 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:37,403 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:37,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,408 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-02-21 03:32:37,410 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-02-21 03:32:37,411 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-02-21 03:32:37,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:37,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:37,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,459 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-02-21 03:32:37,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,461 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-02-21 03:32:37,466 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-02-21 03:32:37,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:37,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:37,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:37,479 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-02-21 03:32:37,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,514 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-02-21 03:32:37,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,515 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-02-21 03:32:37,522 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-02-21 03:32:37,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,530 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-02-21 03:32:37,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:37,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:37,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,562 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-02-21 03:32:37,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,564 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-02-21 03:32:37,565 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-02-21 03:32:37,566 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-02-21 03:32:37,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:37,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:37,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:32:37,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,593 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-02-21 03:32:37,595 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-02-21 03:32:37,595 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-02-21 03:32:37,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:37,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:37,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:37,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,620 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-02-21 03:32:37,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,622 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-02-21 03:32:37,630 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-02-21 03:32:37,631 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-02-21 03:32:37,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:37,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:37,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:32:37,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,690 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-02-21 03:32:37,695 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-02-21 03:32:37,696 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-02-21 03:32:37,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:37,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:37,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:37,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:32:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,722 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-02-21 03:32:37,723 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-02-21 03:32:37,725 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-02-21 03:32:37,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:37,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:37,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:32:37,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,752 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-02-21 03:32:37,752 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-02-21 03:32:37,754 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-02-21 03:32:37,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:37,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:37,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:37,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,778 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-02-21 03:32:37,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,779 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-02-21 03:32:37,783 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-02-21 03:32:37,784 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-02-21 03:32:37,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:37,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:37,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:37,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,808 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-02-21 03:32:37,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,810 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-02-21 03:32:37,811 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-02-21 03:32:37,812 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-02-21 03:32:37,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:37,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,819 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:32:37,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,819 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:32:37,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:37,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,837 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-02-21 03:32:37,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,839 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-02-21 03:32:37,839 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-02-21 03:32:37,841 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-02-21 03:32:37,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:37,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:37,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,891 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-02-21 03:32:37,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,893 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-02-21 03:32:37,893 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-02-21 03:32:37,895 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-02-21 03:32:37,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:37,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:37,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:37,952 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-02-21 03:32:37,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:37,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:37,954 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-02-21 03:32:37,960 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-02-21 03:32:37,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:37,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:37,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:37,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:37,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:37,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:37,974 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-02-21 03:32:37,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:32:38,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,009 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-02-21 03:32:38,010 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-02-21 03:32:38,012 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-02-21 03:32:38,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:38,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:38,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,079 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-02-21 03:32:38,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,081 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-02-21 03:32:38,088 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-02-21 03:32:38,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:38,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:38,117 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-02-21 03:32:38,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:38,181 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:32:38,181 INFO L444 ModelExtractionUtils]: 25 out of 73 variables were initially zero. Simplification set additionally 45 variables to zero. [2022-02-21 03:32:38,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,183 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-02-21 03:32:38,191 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:38,200 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-02-21 03:32:38,216 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:38,216 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:38,216 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-02-21 03:32:38,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:32:38,308 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2022-02-21 03:32:38,312 INFO L390 LassoCheck]: Loop: "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);" "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;" [2022-02-21 03:32:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:38,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:38,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:38,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:38,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {467#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {467#unseeded} is VALID [2022-02-21 03:32:38,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {467#unseeded} 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; {467#unseeded} is VALID [2022-02-21 03:32:38,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#unseeded} assume !(main_~Alen~0#1 < 1); {467#unseeded} is VALID [2022-02-21 03:32:38,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {467#unseeded} assume !(main_~Blen~0#1 < 1); {467#unseeded} is VALID [2022-02-21 03:32:38,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {467#unseeded} 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; {467#unseeded} is VALID [2022-02-21 03:32:38,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {467#unseeded} is VALID [2022-02-21 03:32:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:38,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:38,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:38,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {470#(>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|)))} 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); {575#(and (< |ULTIMATE.start_diff_~j~0#1| |ULTIMATE.start_diff_~l2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|))))} is VALID [2022-02-21 03:32:38,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {575#(and (< |ULTIMATE.start_diff_~j~0#1| |ULTIMATE.start_diff_~l2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|))))} 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; {555#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|)))))} is VALID [2022-02-21 03:32:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:38,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:32:38,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:38,411 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:38,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,412 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-02-21 03:32:38,412 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-02-21 03:32:38,458 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-02-21 03:32:38,459 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-02-21 03:32:38,459 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:38,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:38,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:38,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:38,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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-02-21 03:32:38,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:38,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:38,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:38,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2022-02-21 03:32:38,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:38,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:38,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:38,461 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 23 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:38,462 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:38,462 INFO L70 LassoExtractor]: Start lassoExtractor. 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-02-21 03:32:38,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:38,462 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:38,463 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2022-02-21 03:32:38,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:38,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:38,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,463 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:38,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:38,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:38,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,464 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:38,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:38,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:38,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,465 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:38,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:38,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:32:38,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,465 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:32:38,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:32:38,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:38,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,466 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:38,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:38,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:38,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,467 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:38,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:38,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:38,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,467 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:38,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:38,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:38,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,468 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:38,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:38,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:38,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,469 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:38,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:38,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:38,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,469 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:38,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:38,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:38,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,470 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:38,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:38,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,470 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:38,471 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-02-21 03:32:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:32:38,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:38,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:38,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:38,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:38,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2022-02-21 03:32:38,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:38,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2022-02-21 03:32:38,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:32:38,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:32:38,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2022-02-21 03:32:38,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:38,475 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2022-02-21 03:32:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2022-02-21 03:32:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-02-21 03:32:38,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:38,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 39 transitions. Second 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-02-21 03:32:38,477 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 39 transitions. Second 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-02-21 03:32:38,477 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second 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-02-21 03:32:38,477 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:38,478 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-21 03:32:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-21 03:32:38,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:38,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:38,479 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 27 states and 39 transitions. [2022-02-21 03:32:38,479 INFO L87 Difference]: Start difference. First 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) Second operand 27 states and 39 transitions. [2022-02-21 03:32:38,480 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:38,481 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-21 03:32:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-21 03:32:38,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:38,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:38,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:38,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:38,482 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-02-21 03:32:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-02-21 03:32:38,482 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-02-21 03:32:38,482 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-02-21 03:32:38,483 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:32:38,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-02-21 03:32:38,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:38,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:38,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:38,483 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:38,484 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:38,484 INFO L791 eck$LassoCheckResult]: Stem: 627#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 628#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; 641#L574 assume !(main_~Alen~0#1 < 1); 640#L574-2 assume !(main_~Blen~0#1 < 1); 635#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; 636#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 638#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); 646#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; 645#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 642#L557-2 assume !(0 == diff_~found~0#1); 634#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 637#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 630#L558-2 [2022-02-21 03:32:38,484 INFO L793 eck$LassoCheckResult]: Loop: 630#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); 629#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; 630#L558-2 [2022-02-21 03:32:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2022-02-21 03:32:38,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:38,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294609438] [2022-02-21 03:32:38,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:38,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {765#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {765#true} is VALID [2022-02-21 03:32:38,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {765#true} 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; {765#true} is VALID [2022-02-21 03:32:38,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {765#true} assume !(main_~Alen~0#1 < 1); {765#true} is VALID [2022-02-21 03:32:38,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {765#true} assume !(main_~Blen~0#1 < 1); {765#true} is VALID [2022-02-21 03:32:38,511 INFO L290 TraceCheckUtils]: 4: Hoare triple {765#true} 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; {765#true} is VALID [2022-02-21 03:32:38,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {765#true} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {767#(= |ULTIMATE.start_diff_~found~0#1| 0)} is VALID [2022-02-21 03:32:38,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {767#(= |ULTIMATE.start_diff_~found~0#1| 0)} 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); {767#(= |ULTIMATE.start_diff_~found~0#1| 0)} is VALID [2022-02-21 03:32:38,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {767#(= |ULTIMATE.start_diff_~found~0#1| 0)} 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; {767#(= |ULTIMATE.start_diff_~found~0#1| 0)} is VALID [2022-02-21 03:32:38,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {767#(= |ULTIMATE.start_diff_~found~0#1| 0)} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {767#(= |ULTIMATE.start_diff_~found~0#1| 0)} is VALID [2022-02-21 03:32:38,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {767#(= |ULTIMATE.start_diff_~found~0#1| 0)} assume !(0 == diff_~found~0#1); {766#false} is VALID [2022-02-21 03:32:38,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {766#false} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {766#false} is VALID [2022-02-21 03:32:38,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#false} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {766#false} is VALID [2022-02-21 03:32:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:32:38,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:38,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294609438] [2022-02-21 03:32:38,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294609438] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:38,514 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:38,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:32:38,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303030460] [2022-02-21 03:32:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:38,515 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2022-02-21 03:32:38,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:38,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512552604] [2022-02-21 03:32:38,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:38,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:38,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:38,524 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:38,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:38,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:32:38,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:32:38,601 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-02-21 03:32:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:38,621 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-02-21 03:32:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:32:38,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:32:38,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:38,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2022-02-21 03:32:38,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:38,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2022-02-21 03:32:38,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:32:38,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:32:38,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2022-02-21 03:32:38,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:38,644 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-02-21 03:32:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2022-02-21 03:32:38,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-02-21 03:32:38,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:38,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 31 transitions. Second 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-02-21 03:32:38,646 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 31 transitions. Second 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-02-21 03:32:38,646 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second 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-02-21 03:32:38,646 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:38,647 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2022-02-21 03:32:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2022-02-21 03:32:38,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:38,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:38,648 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 22 states and 31 transitions. [2022-02-21 03:32:38,648 INFO L87 Difference]: Start difference. First 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) Second operand 22 states and 31 transitions. [2022-02-21 03:32:38,648 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:38,649 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2022-02-21 03:32:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2022-02-21 03:32:38,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:38,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:38,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:38,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:38,651 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-02-21 03:32:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-02-21 03:32:38,652 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-02-21 03:32:38,652 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-02-21 03:32:38,652 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:32:38,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2022-02-21 03:32:38,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:38,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:38,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:38,653 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:38,653 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:38,653 INFO L791 eck$LassoCheckResult]: Stem: 792#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 793#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; 807#L574 assume !(main_~Alen~0#1 < 1); 805#L574-2 assume !(main_~Blen~0#1 < 1); 800#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; 801#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 803#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); 811#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; 810#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 798#L557-2 assume !(0 == diff_~found~0#1); 799#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 802#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 795#L558-2 [2022-02-21 03:32:38,653 INFO L793 eck$LassoCheckResult]: Loop: 795#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); 794#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; 795#L558-2 [2022-02-21 03:32:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2022-02-21 03:32:38,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:38,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732181797] [2022-02-21 03:32:38,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:38,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:38,706 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2022-02-21 03:32:38,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:38,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671061764] [2022-02-21 03:32:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:38,717 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:38,721 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:38,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2022-02-21 03:32:38,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:38,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258347642] [2022-02-21 03:32:38,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:38,745 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:38,782 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-02-21 03:32:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:38,794 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:39,697 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:39,697 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:39,697 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:39,697 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:39,697 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:39,697 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:39,698 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:39,698 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:39,698 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration7_Lasso [2022-02-21 03:32:39,698 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:39,698 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:39,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:39,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:39,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,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-02-21 03:32:40,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:40,943 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:40,943 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:40,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:40,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:40,947 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-02-21 03:32:40,949 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-02-21 03:32:40,949 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-02-21 03:32:40,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:40,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:40,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:40,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:40,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:40,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:40,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:40,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:32:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:40,977 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-02-21 03:32:40,978 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-02-21 03:32:40,979 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-02-21 03:32:40,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:40,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:40,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:40,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:40,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:40,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:41,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:41,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:41,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,037 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-02-21 03:32:41,037 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-02-21 03:32:41,039 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-02-21 03:32:41,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:41,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:41,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:41,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:41,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:41,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:41,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:41,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:32:41,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,074 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-02-21 03:32:41,074 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-02-21 03:32:41,076 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-02-21 03:32:41,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:41,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:41,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:41,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:41,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:41,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:41,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:41,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:32:41,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,105 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-02-21 03:32:41,106 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-02-21 03:32:41,107 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-02-21 03:32:41,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:41,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:41,113 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:32:41,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:41,117 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:32:41,118 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:32:41,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:41,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:32:41,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,164 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-02-21 03:32:41,165 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-02-21 03:32:41,165 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-02-21 03:32:41,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:41,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:41,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:41,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:41,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:41,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:41,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:41,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:41,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,204 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-02-21 03:32:41,205 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-02-21 03:32:41,235 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-02-21 03:32:41,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:41,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:41,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:41,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:41,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:41,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:41,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:41,262 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-02-21 03:32:41,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,263 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-02-21 03:32:41,264 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-02-21 03:32:41,266 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-02-21 03:32:41,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:41,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:41,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:41,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:41,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:41,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:41,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:41,423 INFO L443 ModelExtractionUtils]: Simplification made 44 calls to the SMT solver. [2022-02-21 03:32:41,423 INFO L444 ModelExtractionUtils]: 15 out of 67 variables were initially zero. Simplification set additionally 49 variables to zero. [2022-02-21 03:32:41,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:41,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:41,424 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-02-21 03:32:41,425 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-02-21 03:32:41,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:41,435 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:41,435 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:41,435 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-02-21 03:32:41,454 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-02-21 03:32:41,545 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2022-02-21 03:32:41,552 INFO L390 LassoCheck]: Loop: "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);" "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;" [2022-02-21 03:32:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:41,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:32:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:41,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:41,732 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-02-21 03:32:41,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {921#unseeded} is VALID [2022-02-21 03:32:41,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#unseeded} 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; {921#unseeded} is VALID [2022-02-21 03:32:41,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {921#unseeded} assume !(main_~Alen~0#1 < 1); {921#unseeded} is VALID [2022-02-21 03:32:41,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {921#unseeded} assume !(main_~Blen~0#1 < 1); {921#unseeded} is VALID [2022-02-21 03:32:41,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {921#unseeded} 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; {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:41,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:41,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} 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); {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:41,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:41,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:41,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume !(0 == diff_~found~0#1); {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:41,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {1046#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {1065#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~A#1.offset| 0) (= |ULTIMATE.start_diff_~i~0#1| 1))} is VALID [2022-02-21 03:32:41,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {1065#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~A#1.offset| 0) (= |ULTIMATE.start_diff_~i~0#1| 1))} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1025#(and unseeded (= (+ |ULTIMATE.start_diff_~A#1.offset| (* |ULTIMATE.start_diff_~i~0#1| 4) (- 4)) |ULTIMATE.start_diff_~B#1.offset|))} is VALID [2022-02-21 03:32:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:41,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:32:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:41,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:41,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {1026#(and (>= oldRank0 (+ (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (* (- 8) |ULTIMATE.start_diff_~j~0#1|))) (= (+ |ULTIMATE.start_diff_~A#1.offset| (* |ULTIMATE.start_diff_~i~0#1| 4) (- 4)) |ULTIMATE.start_diff_~B#1.offset|))} 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); {1069#(and (<= 0 (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|))) (= |ULTIMATE.start_diff_~B#1.offset| (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| (- 4))) (<= (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|) 4) (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (<= 0 (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_diff_~j~0#1| (- 8)) (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)))))} is VALID [2022-02-21 03:32:41,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {1069#(and (<= 0 (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|))) (= |ULTIMATE.start_diff_~B#1.offset| (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| (- 4))) (<= (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|) 4) (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (<= 0 (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_diff_~j~0#1| (- 8)) (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)))))} 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; {1028#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (* (- 8) |ULTIMATE.start_diff_~j~0#1|)))) unseeded) (= (+ |ULTIMATE.start_diff_~A#1.offset| (* |ULTIMATE.start_diff_~i~0#1| 4) (- 4)) |ULTIMATE.start_diff_~B#1.offset|))} is VALID [2022-02-21 03:32:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:41,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:32:41,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:41,880 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,880 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-02-21 03:32:41,880 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-02-21 03:32:41,923 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-02-21 03:32:41,923 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-02-21 03:32:41,923 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:41,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:41,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:41,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:41,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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-02-21 03:32:41,924 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:41,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:41,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2022-02-21 03:32:41,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:41,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:41,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:41,925 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:41,925 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:41,926 INFO L70 LassoExtractor]: Start lassoExtractor. 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-02-21 03:32:41,926 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:41,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 8 transitions. cyclomatic complexity: 6 [2022-02-21 03:32:41,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:41,926 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:32:41,926 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:41,926 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:41,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,927 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,927 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:41,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,928 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:41,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:41,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:41,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,929 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:41,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:41,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:41,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,930 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:41,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:41,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:41,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,930 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:41,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:41,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,931 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,931 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:41,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,932 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:41,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:41,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,932 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:41,933 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-02-21 03:32:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:32:41,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:41,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:41,934 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:41,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:41,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:32:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:42,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {921#unseeded} is VALID [2022-02-21 03:32:42,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#unseeded} 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; {921#unseeded} is VALID [2022-02-21 03:32:42,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {921#unseeded} assume !(main_~Alen~0#1 < 1); {921#unseeded} is VALID [2022-02-21 03:32:42,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {921#unseeded} assume !(main_~Blen~0#1 < 1); {921#unseeded} is VALID [2022-02-21 03:32:42,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {921#unseeded} 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; {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} 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); {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume !(0 == diff_~found~0#1); {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {1117#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {1136#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~A#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_diff_~i~0#1|) 0))} is VALID [2022-02-21 03:32:42,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {1136#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~A#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_diff_~i~0#1|) 0))} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1025#(and unseeded (= (+ |ULTIMATE.start_diff_~A#1.offset| (* |ULTIMATE.start_diff_~i~0#1| 4) (- 4)) |ULTIMATE.start_diff_~B#1.offset|))} is VALID [2022-02-21 03:32:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:32:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:42,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {1026#(and (>= oldRank0 (+ (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (* (- 8) |ULTIMATE.start_diff_~j~0#1|))) (= (+ |ULTIMATE.start_diff_~A#1.offset| (* |ULTIMATE.start_diff_~i~0#1| 4) (- 4)) |ULTIMATE.start_diff_~B#1.offset|))} 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); {1140#(and (<= 0 (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|))) (= |ULTIMATE.start_diff_~B#1.offset| (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| (- 4))) (<= (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|) 4) (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (<= 0 (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_diff_~j~0#1| (- 8)) (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)))))} is VALID [2022-02-21 03:32:42,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {1140#(and (<= 0 (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|))) (= |ULTIMATE.start_diff_~B#1.offset| (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| (- 4))) (<= (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|) 4) (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (<= 0 (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_diff_~j~0#1| (- 8)) (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)))))} 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; {1028#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (* (- 8) |ULTIMATE.start_diff_~j~0#1|)))) unseeded) (= (+ |ULTIMATE.start_diff_~A#1.offset| (* |ULTIMATE.start_diff_~i~0#1| 4) (- 4)) |ULTIMATE.start_diff_~B#1.offset|))} is VALID [2022-02-21 03:32:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:42,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:32:42,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:42,214 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,214 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-02-21 03:32:42,215 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-02-21 03:32:42,254 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-02-21 03:32:42,254 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-02-21 03:32:42,254 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:42,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:42,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:42,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:42,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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-02-21 03:32:42,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:42,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:42,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2022-02-21 03:32:42,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:42,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:42,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:42,260 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:42,260 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:42,260 INFO L70 LassoExtractor]: Start lassoExtractor. 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-02-21 03:32:42,261 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:42,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 8 transitions. cyclomatic complexity: 6 [2022-02-21 03:32:42,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:42,261 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:32:42,261 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:42,261 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:42,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,263 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:42,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,264 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:42,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:42,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:42,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,264 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:42,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:42,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:42,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,265 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:42,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:42,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:42,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,266 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:42,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:42,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,269 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:42,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,269 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:42,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:42,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,270 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,270 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:42,271 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-02-21 03:32:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:32:42,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,272 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:32:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:42,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {921#unseeded} is VALID [2022-02-21 03:32:42,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#unseeded} 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; {921#unseeded} is VALID [2022-02-21 03:32:42,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {921#unseeded} assume !(main_~Alen~0#1 < 1); {921#unseeded} is VALID [2022-02-21 03:32:42,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {921#unseeded} assume !(main_~Blen~0#1 < 1); {921#unseeded} is VALID [2022-02-21 03:32:42,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {921#unseeded} 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; {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} 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); {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} assume !(0 == diff_~found~0#1); {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} is VALID [2022-02-21 03:32:42,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {1188#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~i~0#1| 0) (= |ULTIMATE.start_diff_~A#1.offset| 0))} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {1207#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~A#1.offset| 0) (= |ULTIMATE.start_diff_~i~0#1| 1))} is VALID [2022-02-21 03:32:42,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {1207#(and (= |ULTIMATE.start_diff_~B#1.offset| 0) unseeded (= |ULTIMATE.start_diff_~A#1.offset| 0) (= |ULTIMATE.start_diff_~i~0#1| 1))} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1025#(and unseeded (= (+ |ULTIMATE.start_diff_~A#1.offset| (* |ULTIMATE.start_diff_~i~0#1| 4) (- 4)) |ULTIMATE.start_diff_~B#1.offset|))} is VALID [2022-02-21 03:32:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:32:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:42,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:42,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {1026#(and (>= oldRank0 (+ (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (* (- 8) |ULTIMATE.start_diff_~j~0#1|))) (= (+ |ULTIMATE.start_diff_~A#1.offset| (* |ULTIMATE.start_diff_~i~0#1| 4) (- 4)) |ULTIMATE.start_diff_~B#1.offset|))} 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); {1211#(and (<= 0 (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|))) (= |ULTIMATE.start_diff_~B#1.offset| (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| (- 4))) (<= (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|) 4) (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (<= 0 (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_diff_~j~0#1| (- 8)) (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)))))} is VALID [2022-02-21 03:32:42,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#(and (<= 0 (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|))) (= |ULTIMATE.start_diff_~B#1.offset| (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset| (- 4))) (<= (+ |ULTIMATE.start_diff_~B#1.offset| (* 4 |ULTIMATE.start_diff_~j~0#1|) 4) (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (<= 0 (+ (* 4 |ULTIMATE.start_diff_~i~0#1|) |ULTIMATE.start_diff_~A#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_diff_~j~0#1| (- 8)) (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)))))} 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; {1028#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* 3 (select |#length| |ULTIMATE.start_diff_~B#1.base|)) (* (- 8) |ULTIMATE.start_diff_~j~0#1|)))) unseeded) (= (+ |ULTIMATE.start_diff_~A#1.offset| (* |ULTIMATE.start_diff_~i~0#1| 4) (- 4)) |ULTIMATE.start_diff_~B#1.offset|))} is VALID [2022-02-21 03:32:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:42,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:32:42,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:42,555 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,555 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-02-21 03:32:42,555 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-02-21 03:32:42,690 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-02-21 03:32:42,690 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-02-21 03:32:42,690 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:42,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:42,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:42,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:42,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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-02-21 03:32:42,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:42,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:42,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:42,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 58 transitions. [2022-02-21 03:32:42,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:42,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:42,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:42,692 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:42,693 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:42,693 INFO L70 LassoExtractor]: Start lassoExtractor. 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-02-21 03:32:42,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:42,694 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:42,694 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 58 transitions. cyclomatic complexity: 18 [2022-02-21 03:32:42,695 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:42,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,695 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:32:42,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,695 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:32:42,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:32:42,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 2 letters. [2022-02-21 03:32:42,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,696 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 20 letters. Loop has 2 letters. [2022-02-21 03:32:42,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 2 letters. [2022-02-21 03:32:42,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:32:42,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,697 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:32:42,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:32:42,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:42,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,698 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:42,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:32:42,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:42,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,699 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:42,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:42,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:42,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,700 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:42,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:32:42,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,701 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:32:42,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:32:42,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:32:42,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 2 letters. [2022-02-21 03:32:42,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 20 letters. Loop has 2 letters. [2022-02-21 03:32:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 2 letters. [2022-02-21 03:32:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 21 letters. Loop has 2 letters. [2022-02-21 03:32:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 21 letters. Loop has 2 letters. [2022-02-21 03:32:42,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 2 letters. [2022-02-21 03:32:42,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,704 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:42,705 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-02-21 03:32:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-02-21 03:32:42,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:32:42,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:32:42,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:32:42,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:42,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. cyclomatic complexity: 18 [2022-02-21 03:32:42,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:42,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 36 states and 47 transitions. [2022-02-21 03:32:42,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:32:42,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:32:42,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2022-02-21 03:32:42,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:42,709 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-02-21 03:32:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2022-02-21 03:32:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-02-21 03:32:42,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:42,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 47 transitions. Second 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-02-21 03:32:42,711 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 47 transitions. Second 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-02-21 03:32:42,712 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second 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-02-21 03:32:42,712 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:42,713 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-02-21 03:32:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-02-21 03:32:42,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:42,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:42,714 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 36 states and 47 transitions. [2022-02-21 03:32:42,714 INFO L87 Difference]: Start difference. First 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) Second operand 36 states and 47 transitions. [2022-02-21 03:32:42,715 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:42,716 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-02-21 03:32:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-02-21 03:32:42,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:42,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:42,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:42,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:42,717 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-02-21 03:32:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-02-21 03:32:42,718 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-02-21 03:32:42,718 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-02-21 03:32:42,718 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:32:42,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. [2022-02-21 03:32:42,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:42,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:42,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:42,719 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:42,719 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:42,719 INFO L791 eck$LassoCheckResult]: Stem: 1280#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1281#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; 1296#L574 assume !(main_~Alen~0#1 < 1); 1294#L574-2 assume !(main_~Blen~0#1 < 1); 1288#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; 1289#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 1291#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); 1302#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; 1304#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 1300#L557-2 assume !(0 == diff_~found~0#1); 1298#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 1292#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 1293#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); 1284#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; 1285#L558-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 1306#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; 1287#L564-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 1290#L554-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 1283#L558-2 [2022-02-21 03:32:42,719 INFO L793 eck$LassoCheckResult]: Loop: 1283#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); 1282#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; 1283#L558-2 [2022-02-21 03:32:42,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:42,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1877942842, now seen corresponding path program 1 times [2022-02-21 03:32:42,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:42,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310729981] [2022-02-21 03:32:42,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:42,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:42,742 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:42,757 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 4 times [2022-02-21 03:32:42,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:42,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350645694] [2022-02-21 03:32:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:42,764 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:42,767 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:42,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:42,768 INFO L85 PathProgramCache]: Analyzing trace with hash -816805781, now seen corresponding path program 2 times [2022-02-21 03:32:42,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:42,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496382801] [2022-02-21 03:32:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:42,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:42,808 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:44,144 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:44,144 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:44,144 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:44,144 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:44,144 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:44,145 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:44,145 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:44,145 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:44,145 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration8_Lasso [2022-02-21 03:32:44,145 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:44,145 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:44,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:44,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:45,560 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:45,560 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:45,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,562 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-02-21 03:32:45,563 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-02-21 03:32:45,564 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-02-21 03:32:45,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:45,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:45,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:32:45,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,589 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-02-21 03:32:45,591 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-02-21 03:32:45,593 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-02-21 03:32:45,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:45,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:45,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:45,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:45,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,639 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-02-21 03:32:45,639 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-02-21 03:32:45,641 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-02-21 03:32:45,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:45,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:45,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:45,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:45,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,672 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-02-21 03:32:45,674 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-02-21 03:32:45,675 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-02-21 03:32:45,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:45,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:45,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,698 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-02-21 03:32:45,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,700 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-02-21 03:32:45,700 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-02-21 03:32:45,702 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-02-21 03:32:45,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:45,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:45,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:45,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,724 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-02-21 03:32:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,725 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-02-21 03:32:45,728 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-02-21 03:32:45,728 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-02-21 03:32:45,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:45,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:45,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:32:45,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,752 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-02-21 03:32:45,753 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-02-21 03:32:45,754 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-02-21 03:32:45,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:45,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:45,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:45,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:32:45,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,776 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-02-21 03:32:45,777 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-02-21 03:32:45,782 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-02-21 03:32:45,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:45,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:45,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:45,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:32:45,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,804 INFO L229 MonitoredProcess]: Starting monitored process 45 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-02-21 03:32:45,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:32:45,805 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-02-21 03:32:45,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:45,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:45,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:45,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,832 INFO L229 MonitoredProcess]: Starting monitored process 46 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-02-21 03:32:45,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:32:45,834 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-02-21 03:32:45,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:45,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:45,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:45,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:32:45,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,857 INFO L229 MonitoredProcess]: Starting monitored process 47 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-02-21 03:32:45,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:32:45,859 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-02-21 03:32:45,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:45,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:45,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 03:32:45,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,885 INFO L229 MonitoredProcess]: Starting monitored process 48 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-02-21 03:32:45,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:32:45,892 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-02-21 03:32:45,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:45,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:45,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:32:45,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,917 INFO L229 MonitoredProcess]: Starting monitored process 49 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-02-21 03:32:45,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:32:45,919 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-02-21 03:32:45,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:45,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:45,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:45,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:32:45,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,941 INFO L229 MonitoredProcess]: Starting monitored process 50 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-02-21 03:32:45,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:32:45,943 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-02-21 03:32:45,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:45,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:45,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:45,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,971 INFO L229 MonitoredProcess]: Starting monitored process 51 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-02-21 03:32:45,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:32:45,974 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-02-21 03:32:45,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:45,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:45,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:45,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:45,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:45,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:45,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:45,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:45,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:32:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:45,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:45,996 INFO L229 MonitoredProcess]: Starting monitored process 52 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-02-21 03:32:45,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:32:45,998 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-02-21 03:32:46,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:46,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:46,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 03:32:46,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,024 INFO L229 MonitoredProcess]: Starting monitored process 53 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-02-21 03:32:46,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:32:46,027 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-02-21 03:32:46,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:46,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:46,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:32:46,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,073 INFO L229 MonitoredProcess]: Starting monitored process 54 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-02-21 03:32:46,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:32:46,075 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-02-21 03:32:46,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:46,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:46,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:46,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:46,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,098 INFO L229 MonitoredProcess]: Starting monitored process 55 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-02-21 03:32:46,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:32:46,099 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-02-21 03:32:46,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:46,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:46,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:46,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:46,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:46,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:46,134 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:46,158 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 03:32:46,159 INFO L444 ModelExtractionUtils]: 23 out of 73 variables were initially zero. Simplification set additionally 47 variables to zero. [2022-02-21 03:32:46,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:46,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:46,164 INFO L229 MonitoredProcess]: Starting monitored process 56 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-02-21 03:32:46,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:32:46,166 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:46,173 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:46,173 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:46,173 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-02-21 03:32:46,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,308 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2022-02-21 03:32:46,311 INFO L390 LassoCheck]: Loop: "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);" "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;" [2022-02-21 03:32:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:46,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1465#unseeded} is VALID [2022-02-21 03:32:46,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#unseeded} assume !(main_~Alen~0#1 < 1); {1465#unseeded} is VALID [2022-02-21 03:32:46,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {1465#unseeded} assume !(main_~Blen~0#1 < 1); {1465#unseeded} is VALID [2022-02-21 03:32:46,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1465#unseeded} is VALID [2022-02-21 03:32:46,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {1465#unseeded} 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); {1465#unseeded} is VALID [2022-02-21 03:32:46,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#unseeded} assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; {1465#unseeded} is VALID [2022-02-21 03:32:46,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#unseeded} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {1465#unseeded} is VALID [2022-02-21 03:32:46,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#unseeded} assume !(0 == diff_~found~0#1); {1465#unseeded} is VALID [2022-02-21 03:32:46,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#unseeded} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {1465#unseeded} is VALID [2022-02-21 03:32:46,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1465#unseeded} is VALID [2022-02-21 03:32:46,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#unseeded} 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); {1465#unseeded} is VALID [2022-02-21 03:32:46,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#unseeded} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {1465#unseeded} is VALID [2022-02-21 03:32:46,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#unseeded} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {1465#unseeded} is VALID [2022-02-21 03:32:46,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1465#unseeded} is VALID [2022-02-21 03:32:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:46,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {1468#(>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|)))} 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); {1669#(and (< |ULTIMATE.start_diff_~j~0#1| |ULTIMATE.start_diff_~l2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|))))} is VALID [2022-02-21 03:32:46,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {1669#(and (< |ULTIMATE.start_diff_~j~0#1| |ULTIMATE.start_diff_~l2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|))))} 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; {1613#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|)))))} is VALID [2022-02-21 03:32:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:46,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:46,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,448 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-02-21 03:32:46,448 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 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,483 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 5.333333333333333) internal successors, (16), 3 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) Result 40 states and 53 transitions. Complement of second has 7 states. [2022-02-21 03:32:46,483 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-02-21 03:32:46,483 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:46,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:46,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:46,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:46,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:46,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:46,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:46,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2022-02-21 03:32:46,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:46,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:46,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:46,485 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:46,485 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:46,485 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:46,486 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:46,486 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 53 transitions. cyclomatic complexity: 17 [2022-02-21 03:32:46,486 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:46,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:32:46,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:32:46,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:32:46,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:32:46,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:32:46,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:32:46,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:46,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:46,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:46,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,497 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-21 03:32:46,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,498 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:46,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1465#unseeded} is VALID [2022-02-21 03:32:46,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#unseeded} assume !(main_~Alen~0#1 < 1); {1465#unseeded} is VALID [2022-02-21 03:32:46,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {1465#unseeded} assume !(main_~Blen~0#1 < 1); {1465#unseeded} is VALID [2022-02-21 03:32:46,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1465#unseeded} is VALID [2022-02-21 03:32:46,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {1465#unseeded} 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); {1465#unseeded} is VALID [2022-02-21 03:32:46,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#unseeded} assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; {1465#unseeded} is VALID [2022-02-21 03:32:46,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#unseeded} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {1465#unseeded} is VALID [2022-02-21 03:32:46,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#unseeded} assume !(0 == diff_~found~0#1); {1465#unseeded} is VALID [2022-02-21 03:32:46,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#unseeded} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {1465#unseeded} is VALID [2022-02-21 03:32:46,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1465#unseeded} is VALID [2022-02-21 03:32:46,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#unseeded} 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); {1465#unseeded} is VALID [2022-02-21 03:32:46,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#unseeded} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {1465#unseeded} is VALID [2022-02-21 03:32:46,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#unseeded} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {1465#unseeded} is VALID [2022-02-21 03:32:46,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1465#unseeded} is VALID [2022-02-21 03:32:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:46,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:46,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {1468#(>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|)))} 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); {1778#(and (< |ULTIMATE.start_diff_~j~0#1| |ULTIMATE.start_diff_~l2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|))))} is VALID [2022-02-21 03:32:46,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#(and (< |ULTIMATE.start_diff_~j~0#1| |ULTIMATE.start_diff_~l2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|))))} 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; {1613#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|)))))} is VALID [2022-02-21 03:32:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:46,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:46,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,638 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-02-21 03:32:46,638 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 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,667 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 5.333333333333333) internal successors, (16), 3 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) Result 40 states and 53 transitions. Complement of second has 7 states. [2022-02-21 03:32:46,668 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-02-21 03:32:46,668 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:46,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:46,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:46,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:46,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:46,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:46,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:46,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2022-02-21 03:32:46,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:46,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:46,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:46,670 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:46,670 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:46,671 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:46,671 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:46,671 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 53 transitions. cyclomatic complexity: 17 [2022-02-21 03:32:46,672 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:46,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:32:46,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:32:46,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:32:46,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:32:46,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:32:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:32:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,681 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-21 03:32:46,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,682 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:46,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1465#unseeded} is VALID [2022-02-21 03:32:46,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#unseeded} assume !(main_~Alen~0#1 < 1); {1465#unseeded} is VALID [2022-02-21 03:32:46,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {1465#unseeded} assume !(main_~Blen~0#1 < 1); {1465#unseeded} is VALID [2022-02-21 03:32:46,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1465#unseeded} is VALID [2022-02-21 03:32:46,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {1465#unseeded} 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); {1465#unseeded} is VALID [2022-02-21 03:32:46,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#unseeded} assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; {1465#unseeded} is VALID [2022-02-21 03:32:46,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#unseeded} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {1465#unseeded} is VALID [2022-02-21 03:32:46,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#unseeded} assume !(0 == diff_~found~0#1); {1465#unseeded} is VALID [2022-02-21 03:32:46,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#unseeded} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {1465#unseeded} is VALID [2022-02-21 03:32:46,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1465#unseeded} is VALID [2022-02-21 03:32:46,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#unseeded} 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); {1465#unseeded} is VALID [2022-02-21 03:32:46,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#unseeded} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {1465#unseeded} is VALID [2022-02-21 03:32:46,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#unseeded} 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; {1465#unseeded} is VALID [2022-02-21 03:32:46,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#unseeded} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {1465#unseeded} is VALID [2022-02-21 03:32:46,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#unseeded} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {1465#unseeded} is VALID [2022-02-21 03:32:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:46,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:46,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {1468#(>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|)))} 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); {1887#(and (< |ULTIMATE.start_diff_~j~0#1| |ULTIMATE.start_diff_~l2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|))))} is VALID [2022-02-21 03:32:46,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#(and (< |ULTIMATE.start_diff_~j~0#1| |ULTIMATE.start_diff_~l2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|))))} 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; {1613#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_diff_~l2~0#1| (* (- 1) |ULTIMATE.start_diff_~j~0#1|)))))} is VALID [2022-02-21 03:32:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:46,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:46,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,798 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-02-21 03:32:46,798 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 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,831 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 5.333333333333333) internal successors, (16), 3 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) Result 54 states and 74 transitions. Complement of second has 6 states. [2022-02-21 03:32:46,832 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-02-21 03:32:46,832 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:46,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:46,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:46,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:46,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:46,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:46,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:46,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 74 transitions. [2022-02-21 03:32:46,834 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:46,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:46,834 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:46,834 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:46,834 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:46,835 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:46,835 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 74 transitions. cyclomatic complexity: 24 [2022-02-21 03:32:46,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 74 transitions. cyclomatic complexity: 24 [2022-02-21 03:32:46,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:46,836 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:32:46,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 74 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 74 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:32:46,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:32:46,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 74 transitions. cyclomatic complexity: 24 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:32:46,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:32:46,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:32:46,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 74 transitions. cyclomatic complexity: 24 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:32:46,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:46,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:46,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 74 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:46,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 74 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 2 letters. [2022-02-21 03:32:46,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 74 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 74 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:46,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,842 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-21 03:32:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-21 03:32:46,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 18 letters. Loop has 2 letters. [2022-02-21 03:32:46,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 2 letters. [2022-02-21 03:32:46,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:32:46,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:46,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 74 transitions. cyclomatic complexity: 24 [2022-02-21 03:32:46,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:46,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2022-02-21 03:32:46,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:32:46,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:32:46,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:32:46,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:46,846 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:46,846 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:46,846 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:46,846 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:32:46,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:32:46,847 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:46,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:46,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:32:46 BoogieIcfgContainer [2022-02-21 03:32:46,852 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:32:46,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:32:46,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:32:46,853 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:32:46,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:30" (3/4) ... [2022-02-21 03:32:46,856 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:32:46,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:32:46,857 INFO L158 Benchmark]: Toolchain (without parser) took 17498.60ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 86.2MB in the beginning and 65.8MB in the end (delta: 20.4MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2022-02-21 03:32:46,857 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 81.8MB. Free memory was 62.2MB in the beginning and 62.1MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:46,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.33ms. Allocated memory is still 107.0MB. Free memory was 86.2MB in the beginning and 74.9MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:32:46,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.04ms. Allocated memory is still 107.0MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:46,858 INFO L158 Benchmark]: Boogie Preprocessor took 29.92ms. Allocated memory is still 107.0MB. Free memory was 72.8MB in the beginning and 71.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:46,858 INFO L158 Benchmark]: RCFGBuilder took 389.88ms. Allocated memory is still 107.0MB. Free memory was 71.3MB in the beginning and 57.6MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:32:46,859 INFO L158 Benchmark]: BuchiAutomizer took 16559.15ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 57.6MB in the beginning and 65.8MB in the end (delta: -8.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-02-21 03:32:46,859 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 130.0MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:46,860 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 81.8MB. Free memory was 62.2MB in the beginning and 62.1MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.33ms. Allocated memory is still 107.0MB. Free memory was 86.2MB in the beginning and 74.9MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.04ms. Allocated memory is still 107.0MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.92ms. Allocated memory is still 107.0MB. Free memory was 72.8MB in the beginning and 71.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.88ms. Allocated memory is still 107.0MB. Free memory was 71.3MB in the beginning and 57.6MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 16559.15ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 57.6MB in the beginning and 65.8MB in the end (delta: -8.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 130.0MB. Free memory is still 65.8MB. 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 unknown-#length-unknown[A] + -4 * i + -1 * 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 16.4s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 13.8s. Construction of modules took 0.1s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 157 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital270 mio100 ax106 hnf100 lsp84 ukn89 mio100 lsp53 div100 bol100 ite100 ukn100 eq185 hnf90 smp98 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:32:46,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE