./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.03-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/c.03-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 ffd6e9554cad43049f3baa89c0ba2bf94011d3e069a47b1754df8be10679286a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:12,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:12,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:12,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:12,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:12,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:12,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:12,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:12,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:12,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:12,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:12,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:12,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:12,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:12,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:12,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:12,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:12,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:12,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:12,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:12,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:12,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:12,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:12,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:12,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:12,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:12,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:12,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:12,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:12,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:12,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:12,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:12,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:12,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:12,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:12,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:12,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:12,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:12,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:12,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:12,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:12,394 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:12,418 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:12,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:12,419 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:12,419 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:12,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:12,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:12,420 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:12,420 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:12,421 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:12,421 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:12,421 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:12,421 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:12,422 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:12,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:12,422 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:12,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:12,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:12,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:12,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:12,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:12,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:12,423 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:12,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:12,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:12,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:12,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:12,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:12,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:12,425 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:12,425 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 -> ffd6e9554cad43049f3baa89c0ba2bf94011d3e069a47b1754df8be10679286a [2022-02-21 03:32:12,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:12,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:12,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:12,623 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:12,624 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:12,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2022-02-21 03:32:12,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76bb3ea8d/aba9ee7e766f45d39d91b6006d06a407/FLAG2957666d4 [2022-02-21 03:32:13,004 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:13,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2022-02-21 03:32:13,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76bb3ea8d/aba9ee7e766f45d39d91b6006d06a407/FLAG2957666d4 [2022-02-21 03:32:13,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76bb3ea8d/aba9ee7e766f45d39d91b6006d06a407 [2022-02-21 03:32:13,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:13,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:13,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:13,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:13,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:13,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:13" (1/1) ... [2022-02-21 03:32:13,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f009130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:13, skipping insertion in model container [2022-02-21 03:32:13,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:13" (1/1) ... [2022-02-21 03:32:13,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:13,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:13,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:13,664 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:13,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:13,712 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:13,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:13 WrapperNode [2022-02-21 03:32:13,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:13,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:13,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:13,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:13,719 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:13" (1/1) ... [2022-02-21 03:32:13,737 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:13" (1/1) ... [2022-02-21 03:32:13,768 INFO L137 Inliner]: procedures = 111, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2022-02-21 03:32:13,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:13,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:13,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:13,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:13,775 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:13" (1/1) ... [2022-02-21 03:32:13,775 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:13" (1/1) ... [2022-02-21 03:32:13,791 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:13" (1/1) ... [2022-02-21 03:32:13,792 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:13" (1/1) ... [2022-02-21 03:32:13,795 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:13" (1/1) ... [2022-02-21 03:32:13,802 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:13" (1/1) ... [2022-02-21 03:32:13,804 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:13" (1/1) ... [2022-02-21 03:32:13,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:13,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:13,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:13,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:13,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:13" (1/1) ... [2022-02-21 03:32:13,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:13,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:13,848 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:13,866 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:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:13,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:13,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:13,971 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:13,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:14,153 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:14,158 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:14,158 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:32:14,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:14 BoogieIcfgContainer [2022-02-21 03:32:14,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:14,160 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:14,160 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:14,162 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:14,162 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:14,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:13" (1/3) ... [2022-02-21 03:32:14,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d24ac5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:14, skipping insertion in model container [2022-02-21 03:32:14,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:14,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:13" (2/3) ... [2022-02-21 03:32:14,164 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d24ac5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:14, skipping insertion in model container [2022-02-21 03:32:14,164 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:14,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:14" (3/3) ... [2022-02-21 03:32:14,165 INFO L388 chiAutomizerObserver]: Analyzing ICFG c.03-alloca-1.i [2022-02-21 03:32:14,192 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:14,192 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:14,192 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:14,193 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:14,193 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:14,193 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:14,193 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:14,193 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:14,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:14,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:14,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:14,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:14,218 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:14,218 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:14,218 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:14,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:14,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:14,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:14,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:14,220 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:14,221 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:14,225 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; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 9#L558-2true [2022-02-21 03:32:14,225 INFO L793 eck$LassoCheckResult]: Loop: 9#L558-2true call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 < test_fun_#t~mem7#1; 12#L557-1true assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647; 11#L557-3true assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 6#L558true assume test_fun_#t~mem10#1 < test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem12#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 9#L558-2true [2022-02-21 03:32:14,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:14,229 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:32:14,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:14,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773620767] [2022-02-21 03:32:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,416 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2022-02-21 03:32:14,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:14,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422210212] [2022-02-21 03:32:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,460 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2022-02-21 03:32:14,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:14,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387107666] [2022-02-21 03:32:14,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:14,623 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:15,517 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:15,517 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:15,518 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:15,518 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:15,518 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:15,518 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,518 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:15,518 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:15,518 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.03-alloca-1.i_Iteration1_Lasso [2022-02-21 03:32:15,518 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:15,519 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:15,531 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:15,536 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:15,538 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:15,540 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:15,543 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:15,544 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:15,547 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:15,548 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:15,551 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:15,553 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:15,554 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:16,211 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:16,214 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:16,216 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:16,218 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:16,220 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:16,225 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:16,227 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:16,229 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:16,817 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:16,819 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:16,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:16,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:16,822 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:16,823 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:16,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:16,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:16,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:16,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:16,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:16,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:16,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:16,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:16,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:16,859 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:16,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:16,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:16,860 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:16,861 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:16,863 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:16,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:16,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:16,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:16,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:16,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:16,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:16,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:16,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:16,890 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:16,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:16,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:16,891 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:16,892 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:16,893 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:16,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:16,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:16,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:16,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:16,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:16,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:16,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:16,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:16,924 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:16,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:16,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:16,925 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:16,926 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:16,928 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:16,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:16,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:16,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:16,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:16,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:16,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:16,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:16,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:16,951 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:16,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:16,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:16,952 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:16,953 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:16,955 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:16,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:16,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:16,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:16,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:16,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:16,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:16,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:16,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:16,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:16,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:16,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:16,977 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:16,978 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:16,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:16,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:16,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:16,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:16,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:16,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:16,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:16,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,020 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:17,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,022 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:17,023 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:17,024 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:17,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:17,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:17,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:17,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,058 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:17,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,059 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:17,060 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:17,061 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:17,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:17,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,106 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:17,107 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:17,109 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:17,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,151 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:17,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,156 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:17,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:17,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:17,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:17,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:17,171 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:17,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,196 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:17,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,199 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:17,200 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:17,202 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:17,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:32:17,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,247 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:17,248 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:17,250 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:17,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,274 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:17,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,276 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:17,280 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:17,282 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:17,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:17,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,325 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:17,326 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:17,327 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:17,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,385 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:17,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,386 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:17,387 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:17,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:17,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:17,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,419 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:17,420 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:17,421 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:17,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:17,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,474 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:17,475 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:17,477 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:17,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:17,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,516 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:17,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:17,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,534 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:17,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,565 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:17,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,572 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:17,577 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:17,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,584 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:17,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,616 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:17,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,618 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:17,623 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:17,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,630 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:17,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,663 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:17,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,665 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:17,667 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:17,669 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:17,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:17,736 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:32:17,736 INFO L444 ModelExtractionUtils]: 14 out of 40 variables were initially zero. Simplification set additionally 21 variables to zero. [2022-02-21 03:32:17,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,738 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:17,739 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:17,741 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:17,759 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:32:17,759 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:17,760 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#in~y#1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1) = 4294967291*ULTIMATE.start_test_fun_#in~y#1 - 4294967292*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1 + 1*ULTIMATE.start_test_fun_#in~y#1 >= 0] [2022-02-21 03:32:17,809 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:18,029 INFO L297 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2022-02-21 03:32:18,039 INFO L390 LassoCheck]: Loop: "call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 < test_fun_#t~mem7#1;" "assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647;" "assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);" "assume test_fun_#t~mem10#1 < test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem12#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;" [2022-02-21 03:32:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-21 03:32:18,151 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:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:18,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:18,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); {225#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) unseeded)} is VALID [2022-02-21 03:32:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:32:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:18,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 < test_fun_#t~mem7#1; {237#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} is VALID [2022-02-21 03:32:18,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647; {241#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:18,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); {245#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:18,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {245#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume test_fun_#t~mem10#1 < test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem12#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {228#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))))} is VALID [2022-02-21 03:32:18,552 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:18,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:18,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 4 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:18,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,601 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:32:18,602 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:18,726 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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). Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Result 43 states and 47 transitions. Complement of second has 10 states. [2022-02-21 03:32:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:18,726 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:18,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:18,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:18,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:18,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:18,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:18,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:18,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:18,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:18,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2022-02-21 03:32:18,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:18,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:18,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:18,740 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:18,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:18,741 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:18,741 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:18,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:18,742 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:18,742 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 47 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:18,742 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:18,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:18,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:18,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 1 letters. [2022-02-21 03:32:18,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:18,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:18,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 43 letters. Loop has 43 letters. [2022-02-21 03:32:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:32:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:32:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 11 letters. Loop has 11 letters. [2022-02-21 03:32:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 6 letters. Loop has 6 letters. [2022-02-21 03:32:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:18,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:18,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:18,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:18,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:18,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:18,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:18,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:18,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:18,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. Loop has 4 letters. [2022-02-21 03:32:18,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:18,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:18,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 1 letters. [2022-02-21 03:32:18,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:18,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:18,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:18,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:18,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:18,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:18,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:18,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:18,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 8 letters. Loop has 4 letters. [2022-02-21 03:32:18,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:18,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:18,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 6 letters. Loop has 4 letters. [2022-02-21 03:32:18,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:18,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 47 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:18,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,758 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-02-21 03:32:18,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:18,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:18,763 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:32:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:18,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:18,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); {225#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) unseeded)} is VALID [2022-02-21 03:32:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:32:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:19,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 < test_fun_#t~mem7#1; {315#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} is VALID [2022-02-21 03:32:19,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647; {319#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:19,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); {323#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:19,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {323#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume test_fun_#t~mem10#1 < test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem12#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {228#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))))} is VALID [2022-02-21 03:32:19,129 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:19,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 4 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:19,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,138 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:32:19,138 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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). Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Result 21 states and 26 transitions. Complement of second has 8 states. [2022-02-21 03:32:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:19,187 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:19,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:19,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:19,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:19,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:19,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:19,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:19,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:19,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2022-02-21 03:32:19,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:19,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:19,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:19,190 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:19,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:19,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:19,191 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:19,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:19,191 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 26 transitions. cyclomatic complexity: 6 [2022-02-21 03:32:19,195 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 1 letters. [2022-02-21 03:32:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 21 letters. [2022-02-21 03:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 11 letters. Loop has 11 letters. [2022-02-21 03:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 5 letters. [2022-02-21 03:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:19,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:19,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 1 letters. [2022-02-21 03:32:19,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:19,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:19,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 6 letters. Loop has 4 letters. [2022-02-21 03:32:19,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:19,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:19,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:19,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:19,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:19,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,200 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2022-02-21 03:32:19,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,201 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:32:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:19,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:19,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); {225#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) unseeded)} is VALID [2022-02-21 03:32:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:32:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:19,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 < test_fun_#t~mem7#1; {368#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} is VALID [2022-02-21 03:32:19,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647; {372#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:19,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {372#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); {376#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:19,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {376#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume test_fun_#t~mem10#1 < test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem12#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {228#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))))} is VALID [2022-02-21 03:32:19,572 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:19,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 4 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:19,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,583 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 4 loop predicates [2022-02-21 03:32:19,583 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,683 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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). Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Result 44 states and 48 transitions. Complement of second has 9 states. [2022-02-21 03:32:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:19,683 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:19,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:19,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:19,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:19,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:19,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:19,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:19,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:19,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2022-02-21 03:32:19,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:19,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:19,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:19,686 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:19,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:19,687 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:19,689 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:19,691 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:19,691 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 48 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:19,692 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:19,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 1 letters. Loop has 1 letters. [2022-02-21 03:32:19,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:19,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:19,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 44 letters. Loop has 44 letters. [2022-02-21 03:32:19,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:32:19,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:32:19,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 11 letters. Loop has 11 letters. [2022-02-21 03:32:19,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:19,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:19,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 6 letters. Loop has 6 letters. [2022-02-21 03:32:19,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:19,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:19,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:19,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 1 letters. Loop has 1 letters. [2022-02-21 03:32:19,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:19,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:19,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:19,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:19,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:19,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:19,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 8 letters. Loop has 4 letters. [2022-02-21 03:32:19,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:19,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:19,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 6 letters. Loop has 4 letters. [2022-02-21 03:32:19,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:19,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:19,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,698 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-02-21 03:32:19,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:19,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:19,700 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:32:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:19,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:19,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); {225#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) unseeded)} is VALID [2022-02-21 03:32:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:32:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:19,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:20,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 < test_fun_#t~mem7#1; {446#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} is VALID [2022-02-21 03:32:20,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647; {450#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:20,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); {454#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:20,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume test_fun_#t~mem10#1 < test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem12#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {228#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))))} is VALID [2022-02-21 03:32:20,090 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:20,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 4 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:20,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,101 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:32:20,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,195 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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). Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Result 44 states and 48 transitions. Complement of second has 9 states. [2022-02-21 03:32:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:20,195 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:20,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:20,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:20,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:20,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:20,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:20,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:20,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:20,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2022-02-21 03:32:20,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:20,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:20,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:20,197 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:20,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:20,198 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:20,198 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:20,199 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:20,199 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 48 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:20,199 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:20,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 44 letters. Loop has 44 letters. [2022-02-21 03:32:20,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:32:20,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:32:20,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 11 letters. Loop has 11 letters. [2022-02-21 03:32:20,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:20,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:20,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 6 letters. Loop has 6 letters. [2022-02-21 03:32:20,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:20,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:20,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:20,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:20,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:20,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. Loop has 4 letters. [2022-02-21 03:32:20,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:20,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:20,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:20,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:20,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:20,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 8 letters. Loop has 4 letters. [2022-02-21 03:32:20,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:20,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:20,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 6 letters. Loop has 4 letters. [2022-02-21 03:32:20,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:20,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 48 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:20,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,216 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-02-21 03:32:20,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,218 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:20,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:32:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:20,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:20,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:20,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); {225#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) unseeded)} is VALID [2022-02-21 03:32:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:20,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:32:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:20,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:20,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 < test_fun_#t~mem7#1; {524#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} is VALID [2022-02-21 03:32:20,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#(and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (>= oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))} assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647; {528#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:20,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (or (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); {532#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} is VALID [2022-02-21 03:32:20,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {532#(and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#in~y#1|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|) (+ (* 4294967292 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) oldRank0)) (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.offset| Int) (|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) (<= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))} assume test_fun_#t~mem10#1 < test_fun_#t~mem11#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem12#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; {228#(and (>= (+ |ULTIMATE.start_test_fun_#in~y#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4294967292) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (* 4294967291 |ULTIMATE.start_test_fun_#in~y#1|))))))} is VALID [2022-02-21 03:32:20,573 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:20,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 4 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:20,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,583 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:32:20,584 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,805 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Result 109 states and 144 transitions. Complement of second has 22 states 8 powerset states14 rank states. The highest rank that occured is 3 [2022-02-21 03:32:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2022-02-21 03:32:20,805 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2022-02-21 03:32:20,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:20,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:20,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:20,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:20,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:20,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:20,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:20,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 144 transitions. [2022-02-21 03:32:20,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:32:20,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:20,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:20,809 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:20,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:20,809 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:20,809 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:20,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:20,810 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 109 states and 144 transitions. cyclomatic complexity: 38 [2022-02-21 03:32:20,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:20,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 6 letters. Loop has 4 letters. [2022-02-21 03:32:20,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:20,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:20,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 109 letters. Loop has 109 letters. [2022-02-21 03:32:20,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:32:20,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:32:20,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 11 letters. Loop has 11 letters. [2022-02-21 03:32:20,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:20,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:20,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:20,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:20,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:20,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:20,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:20,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:32:20,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:20,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. Loop has 4 letters. [2022-02-21 03:32:20,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:20,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:20,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:20,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 6 letters. Loop has 4 letters. [2022-02-21 03:32:20,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:20,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:20,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 8 letters. Loop has 4 letters. [2022-02-21 03:32:20,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:20,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:20,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 9 letters. Loop has 4 letters. [2022-02-21 03:32:20,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:20,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:20,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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 4 letters. [2022-02-21 03:32:20,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:20,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 144 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:20,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,816 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2022-02-21 03:32:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-02-21 03:32:20,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:32:20,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:20,820 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:20,820 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:32:20,824 INFO L158 Benchmark]: Toolchain (without parser) took 7393.11ms. Allocated memory was 94.4MB in the beginning and 148.9MB in the end (delta: 54.5MB). Free memory was 66.0MB in the beginning and 46.3MB in the end (delta: 19.6MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2022-02-21 03:32:20,824 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:20,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.52ms. Allocated memory is still 94.4MB. Free memory was 65.8MB in the beginning and 64.7MB in the end (delta: 1.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:32:20,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.66ms. Allocated memory is still 94.4MB. Free memory was 64.7MB in the beginning and 62.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:20,825 INFO L158 Benchmark]: Boogie Preprocessor took 42.17ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 61.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:20,825 INFO L158 Benchmark]: RCFGBuilder took 346.80ms. Allocated memory was 94.4MB in the beginning and 123.7MB in the end (delta: 29.4MB). Free memory was 61.2MB in the beginning and 100.7MB in the end (delta: -39.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-02-21 03:32:20,825 INFO L158 Benchmark]: BuchiAutomizer took 6662.58ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 100.7MB in the beginning and 46.3MB in the end (delta: 54.4MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2022-02-21 03:32:20,829 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.14ms. Allocated memory is still 94.4MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.52ms. Allocated memory is still 94.4MB. Free memory was 65.8MB in the beginning and 64.7MB in the end (delta: 1.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.66ms. Allocated memory is still 94.4MB. Free memory was 64.7MB in the beginning and 62.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.17ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 61.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.80ms. Allocated memory was 94.4MB in the beginning and 123.7MB in the end (delta: 29.4MB). Free memory was 61.2MB in the beginning and 100.7MB in the end (delta: -39.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6662.58ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 100.7MB in the beginning and 46.3MB in the end (delta: 54.4MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:32:20,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient