./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/terminator_02-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/loops/terminator_02-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 894c556b0f4feb663ec35a01a2d06acf931df74aff57a717fa48cbd5e0bf347b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:58:21,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:58:21,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:58:21,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:58:21,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:58:21,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:58:21,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:58:21,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:58:21,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:58:21,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:58:21,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:58:21,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:58:21,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:58:21,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:58:21,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:58:21,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:58:21,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:58:21,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:58:21,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:58:21,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:58:21,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:58:21,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:58:21,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:58:21,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:58:21,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:58:21,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:58:21,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:58:21,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:58:21,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:58:21,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:58:21,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:58:21,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:58:21,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:58:21,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:58:21,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:58:21,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:58:21,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:58:21,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:58:21,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:58:21,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:58:21,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:58:21,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:58:21,183 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:58:21,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:58:21,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:58:21,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:58:21,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:58:21,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:58:21,185 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:58:21,186 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:58:21,186 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:58:21,186 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:58:21,186 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:58:21,186 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:58:21,187 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:58:21,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:58:21,187 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:58:21,187 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:58:21,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:58:21,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:58:21,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:58:21,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:58:21,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:58:21,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:58:21,188 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:58:21,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:58:21,188 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:58:21,188 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:58:21,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:58:21,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:58:21,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:58:21,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:58:21,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:58:21,190 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:58:21,190 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 894c556b0f4feb663ec35a01a2d06acf931df74aff57a717fa48cbd5e0bf347b [2022-02-21 03:58:21,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:58:21,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:58:21,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:58:21,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:58:21,388 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:58:21,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/terminator_02-2.c [2022-02-21 03:58:21,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf76e6577/75f0efa1c5f84dafabc755b1af901255/FLAG35334d95c [2022-02-21 03:58:21,744 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:58:21,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/terminator_02-2.c [2022-02-21 03:58:21,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf76e6577/75f0efa1c5f84dafabc755b1af901255/FLAG35334d95c [2022-02-21 03:58:22,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf76e6577/75f0efa1c5f84dafabc755b1af901255 [2022-02-21 03:58:22,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:58:22,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:58:22,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:58:22,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:58:22,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:58:22,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7e3a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22, skipping insertion in model container [2022-02-21 03:58:22,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:58:22,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:58:22,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/terminator_02-2.c[414,427] [2022-02-21 03:58:22,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:58:22,367 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:58:22,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/terminator_02-2.c[414,427] [2022-02-21 03:58:22,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:58:22,400 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:58:22,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22 WrapperNode [2022-02-21 03:58:22,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:58:22,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:58:22,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:58:22,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:58:22,407 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:58:22" (1/1) ... [2022-02-21 03:58:22,412 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:58:22" (1/1) ... [2022-02-21 03:58:22,431 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2022-02-21 03:58:22,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:58:22,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:58:22,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:58:22,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:58:22,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:58:22,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:58:22,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:58:22,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:58:22,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:22,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:22,492 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:58:22,494 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:58:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:58:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:58:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:58:22,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:58:22,566 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:58:22,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:58:22,712 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:58:22,716 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:58:22,716 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:58:22,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:58:22 BoogieIcfgContainer [2022-02-21 03:58:22,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:58:22,718 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:58:22,718 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:58:22,720 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:58:22,720 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:58:22,720 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:58:22" (1/3) ... [2022-02-21 03:58:22,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70bab218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:58:22, skipping insertion in model container [2022-02-21 03:58:22,736 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:58:22,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (2/3) ... [2022-02-21 03:58:22,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70bab218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:58:22, skipping insertion in model container [2022-02-21 03:58:22,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:58:22,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:58:22" (3/3) ... [2022-02-21 03:58:22,738 INFO L388 chiAutomizerObserver]: Analyzing ICFG terminator_02-2.c [2022-02-21 03:58:22,766 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:58:22,766 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:58:22,767 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:58:22,783 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:58:22,783 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:58:22,783 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:58:22,784 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:58:22,784 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:58:22,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:58:22,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:22,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:22,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:22,821 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:58:22,821 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:22,821 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:58:22,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:58:22,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:22,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:22,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:22,827 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:58:22,827 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:22,832 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9#L22true assume !!(main_~x~0#1 > -100); 12#L23true assume !!(main_~x~0#1 < 200); 13#L24true assume !!(main_~z~0#1 > 100); 6#L25true assume !!(main_~z~0#1 < 200); 17#L29-2true [2022-02-21 03:58:22,832 INFO L793 eck$LassoCheckResult]: Loop: 17#L29-2true assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 7#L29true assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 17#L29-2true [2022-02-21 03:58:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2022-02-21 03:58:22,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:22,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563483689] [2022-02-21 03:58:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:22,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,921 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,947 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:22,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 1 times [2022-02-21 03:58:22,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:22,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130249402] [2022-02-21 03:58:22,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:22,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,967 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,983 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:22,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash 179567792, now seen corresponding path program 1 times [2022-02-21 03:58:22,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:22,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276742449] [2022-02-21 03:58:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:22,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:23,008 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:23,024 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:23,109 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:23,112 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:23,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:23,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:23,112 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:58:23,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,112 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:23,112 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:23,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration1_Loop [2022-02-21 03:58:23,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:23,113 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:23,124 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:58:23,134 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:58:23,137 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:58:23,143 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:58:23,265 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:23,266 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:58:23,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,269 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:58:23,270 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:58:23,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:23,274 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:23,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:58:23,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,299 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:58:23,299 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:58:23,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:58:23,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:23,327 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:58:23,330 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:58:23,331 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:23,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:23,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:23,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:23,331 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:23,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:23,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:23,331 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration1_Loop [2022-02-21 03:58:23,331 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:23,331 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:23,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:23,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:23,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:23,351 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:58:23,455 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:23,458 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:58:23,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,465 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:58:23,466 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:58:23,467 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:58:23,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:23,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:23,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:23,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:23,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:23,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:23,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:23,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:23,482 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:58:23,482 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:58:23,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,484 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:58:23,485 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:58:23,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:23,486 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:58:23,487 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:23,487 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 199 Supporting invariants [] [2022-02-21 03:58:23,502 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:58:23,510 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:58:23,514 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2022-02-21 03:58:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:23,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25#unseeded} is VALID [2022-02-21 03:58:23,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {25#unseeded} is VALID [2022-02-21 03:58:23,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !!(main_~x~0#1 > -100); {25#unseeded} is VALID [2022-02-21 03:58:23,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#unseeded} assume !!(main_~x~0#1 < 200); {25#unseeded} is VALID [2022-02-21 03:58:23,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#unseeded} assume !!(main_~z~0#1 > 100); {25#unseeded} is VALID [2022-02-21 03:58:23,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#unseeded} assume !!(main_~z~0#1 < 200); {25#unseeded} is VALID [2022-02-21 03:58:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:23,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {58#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:58:23,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {38#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:58:23,598 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:58:23,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:23,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:23,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:23,648 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,701 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 56 transitions. Complement of second has 8 states. [2022-02-21 03:58:23,701 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:58:23,701 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:23,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:58:23,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:23,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:23,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:23,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:58:23,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:23,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:23,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 56 transitions. [2022-02-21 03:58:23,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:23,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:23,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:23,708 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:58:23,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:23,709 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:23,709 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:58:23,711 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:23,711 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 56 transitions. cyclomatic complexity: 15 [2022-02-21 03:58:23,711 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:23,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:23,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:23,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:23,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:58:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:58:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:58:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 15 letters. Loop has 15 letters. [2022-02-21 03:58:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:58:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:58:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:58:23,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:58:23,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:58:23,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:23,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:23,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:23,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:58:23,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:58:23,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:58:23,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:58:23,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:58:23,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:58:23,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:58:23,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:58:23,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:58:23,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:23,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:23,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 56 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:23,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,719 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-21 03:58:23,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:23,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:23,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:58:23,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. cyclomatic complexity: 15 [2022-02-21 03:58:23,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:23,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 12 states and 15 transitions. [2022-02-21 03:58:23,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:58:23,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:58:23,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2022-02-21 03:58:23,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:58:23,733 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:58:23,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2022-02-21 03:58:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:58:23,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:58:23,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,747 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,748 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,750 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:23,751 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2022-02-21 03:58:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:58:23,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:23,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:23,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 15 transitions. [2022-02-21 03:58:23,752 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 15 transitions. [2022-02-21 03:58:23,752 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:23,753 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2022-02-21 03:58:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:58:23,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:23,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:23,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:58:23,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:58:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 03:58:23,755 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:58:23,755 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:58:23,755 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:58:23,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:58:23,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:23,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:23,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:23,756 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:58:23,756 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:23,756 INFO L791 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 116#L22 assume !!(main_~x~0#1 > -100); 117#L23 assume !!(main_~x~0#1 < 200); 122#L24 assume !!(main_~z~0#1 > 100); 120#L25 assume !!(main_~z~0#1 < 200); 121#L29-2 assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 123#L29 assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; 124#L29-2 [2022-02-21 03:58:23,756 INFO L793 eck$LassoCheckResult]: Loop: 124#L29-2 assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 127#L29 assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124#L29-2 [2022-02-21 03:58:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash 179567794, now seen corresponding path program 1 times [2022-02-21 03:58:23,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:23,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515527026] [2022-02-21 03:58:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:23,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:23,772 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:23,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 2 times [2022-02-21 03:58:23,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:23,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727136958] [2022-02-21 03:58:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:23,776 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:23,778 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash 765959189, now seen corresponding path program 1 times [2022-02-21 03:58:23,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:23,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853849434] [2022-02-21 03:58:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:23,795 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:23,809 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:23,838 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:23,838 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:23,838 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:23,838 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:23,838 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:58:23,838 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,838 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:23,839 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:23,839 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration2_Loop [2022-02-21 03:58:23,839 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:23,839 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:23,839 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:58:23,842 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:58:23,846 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:58:23,848 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:58:23,961 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:23,961 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:58:23,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,965 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:58:23,970 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:58:23,972 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:58:23,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:23,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:24,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:24,016 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0#1=101} Honda state: {ULTIMATE.start_main_~z~0#1=101} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:58:24,034 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:58:24,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,037 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:58:24,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:24,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:24,055 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:58:24,071 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:58:24,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,072 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:58:24,072 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:58:24,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:58:24,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:24,154 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:58:24,159 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:58:24,159 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:24,159 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:24,159 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:24,159 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:24,160 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:24,160 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,160 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:24,160 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:24,160 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration2_Loop [2022-02-21 03:58:24,160 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:24,160 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:24,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:24,173 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:58:24,178 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:58:24,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:24,256 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:24,257 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:58:24,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,258 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:58:24,259 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:58:24,260 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:58:24,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:24,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:24,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:24,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:24,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:24,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:24,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:24,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:24,300 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:58:24,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,302 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:58:24,303 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:58:24,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:58:24,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:24,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:24,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:24,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:24,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:24,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:24,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:24,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:24,334 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:58:24,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,336 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:58:24,337 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:58:24,338 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:58:24,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:24,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:24,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:24,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:24,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:24,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:24,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:24,347 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:24,349 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:58:24,349 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:58:24,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,350 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:58:24,351 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:58:24,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:24,395 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:58:24,395 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:24,395 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 199 Supporting invariants [] [2022-02-21 03:58:24,411 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:58:24,426 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:58:24,437 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2022-02-21 03:58:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:24,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:24,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:24,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {201#unseeded} is VALID [2022-02-21 03:58:24,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {201#unseeded} is VALID [2022-02-21 03:58:24,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#unseeded} assume !!(main_~x~0#1 > -100); {201#unseeded} is VALID [2022-02-21 03:58:24,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {201#unseeded} assume !!(main_~x~0#1 < 200); {201#unseeded} is VALID [2022-02-21 03:58:24,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#unseeded} assume !!(main_~z~0#1 > 100); {201#unseeded} is VALID [2022-02-21 03:58:24,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#unseeded} assume !!(main_~z~0#1 < 200); {201#unseeded} is VALID [2022-02-21 03:58:24,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#unseeded} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {201#unseeded} is VALID [2022-02-21 03:58:24,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; {201#unseeded} is VALID [2022-02-21 03:58:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:24,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:24,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:24,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#(>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {240#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:58:24,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {214#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:58:24,505 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:58:24,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:24,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:24,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:24,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,531 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 21 transitions. Complement of second has 5 states. [2022-02-21 03:58:24,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:24,532 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:24,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 03:58:24,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:24,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:24,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:24,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:24,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:24,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:58:24,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:24,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:24,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:24,534 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 03:58:24,534 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:24,534 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:24,551 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:24,551 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:24,551 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:24,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:24,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:24,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:24,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:24,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:24,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:24,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:24,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:58:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:58:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:58:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:24,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:24,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:24,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:24,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:24,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:24,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:58:24,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:58:24,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:58:24,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:24,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:24,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:24,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:24,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:24,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:24,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:24,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:24,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:24,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,556 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:58:24,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:24,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:24,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:58:24,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:24,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:24,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:24,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2022-02-21 03:58:24,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:58:24,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:58:24,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2022-02-21 03:58:24,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:58:24,559 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:58:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2022-02-21 03:58:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:58:24,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:58:24,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,560 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,560 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,561 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:24,562 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2022-02-21 03:58:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:58:24,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:24,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:24,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 21 transitions. [2022-02-21 03:58:24,562 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 21 transitions. [2022-02-21 03:58:24,562 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:24,563 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2022-02-21 03:58:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:58:24,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:24,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:24,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:58:24,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:58:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-02-21 03:58:24,565 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:58:24,565 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:58:24,565 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:58:24,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:58:24,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:24,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:24,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:24,565 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:58:24,565 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:24,565 INFO L791 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 267#L22 assume !!(main_~x~0#1 > -100); 268#L23 assume !!(main_~x~0#1 < 200); 277#L24 assume !!(main_~z~0#1 > 100); 271#L25 assume !!(main_~z~0#1 < 200); 272#L29-2 assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 273#L29 assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; 274#L29-2 assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 280#L29 assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; 278#L29-2 [2022-02-21 03:58:24,565 INFO L793 eck$LassoCheckResult]: Loop: 278#L29-2 assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 279#L29 assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 278#L29-2 [2022-02-21 03:58:24,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash 765959191, now seen corresponding path program 2 times [2022-02-21 03:58:24,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:24,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926231183] [2022-02-21 03:58:24,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,582 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:24,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 3 times [2022-02-21 03:58:24,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:24,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097882703] [2022-02-21 03:58:24,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:24,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,605 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,607 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1647375930, now seen corresponding path program 2 times [2022-02-21 03:58:24,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:24,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195883699] [2022-02-21 03:58:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,619 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,627 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:24,654 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:24,654 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:24,654 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:24,654 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:24,654 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:58:24,654 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,654 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:24,654 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:24,655 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration3_Loop [2022-02-21 03:58:24,655 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:24,655 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:24,655 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:58:24,659 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:58:24,664 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:58:24,669 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:58:24,755 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:24,755 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:58:24,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,757 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:58:24,758 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:58:24,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:24,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:24,780 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:24,780 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0#1=101} Honda state: {ULTIMATE.start_main_~z~0#1=101} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:58:24,795 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:58:24,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,797 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:58:24,798 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:58:24,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:24,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:24,822 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:58:24,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,823 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:58:24,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:58:24,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:24,826 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:58:24,851 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:58:24,854 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:58:24,854 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:24,854 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:24,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:24,854 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:24,854 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:24,854 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,854 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:24,854 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:24,854 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration3_Loop [2022-02-21 03:58:24,854 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:24,854 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:24,855 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:58:24,863 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:58:24,870 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:58:24,875 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:58:24,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:24,966 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:24,966 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:58:24,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,967 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:58:24,971 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:58:24,975 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:58:24,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:24,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:24,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:24,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:24,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:24,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:24,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:24,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:24,995 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:58:24,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,996 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:58:24,996 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:58:24,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:58:25,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:25,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:25,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:25,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:25,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:25,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:25,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:25,016 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:25,021 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:58:25,021 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:58:25,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,023 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:58:25,023 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:58:25,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:25,025 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:58:25,025 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:25,025 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 199 Supporting invariants [] [2022-02-21 03:58:25,043 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:58:25,057 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:58:25,061 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2022-02-21 03:58:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:25,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {370#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {370#unseeded} is VALID [2022-02-21 03:58:25,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {370#unseeded} is VALID [2022-02-21 03:58:25,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#unseeded} assume !!(main_~x~0#1 > -100); {370#unseeded} is VALID [2022-02-21 03:58:25,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {370#unseeded} assume !!(main_~x~0#1 < 200); {370#unseeded} is VALID [2022-02-21 03:58:25,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {370#unseeded} assume !!(main_~z~0#1 > 100); {370#unseeded} is VALID [2022-02-21 03:58:25,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#unseeded} assume !!(main_~z~0#1 < 200); {370#unseeded} is VALID [2022-02-21 03:58:25,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {370#unseeded} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {370#unseeded} is VALID [2022-02-21 03:58:25,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {370#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; {370#unseeded} is VALID [2022-02-21 03:58:25,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {370#unseeded} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {370#unseeded} is VALID [2022-02-21 03:58:25,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {370#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; {370#unseeded} is VALID [2022-02-21 03:58:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:25,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {373#(>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {415#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:58:25,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {383#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:58:25,158 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:58:25,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:25,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,164 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:25,164 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,184 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 25 transitions. Complement of second has 5 states. [2022-02-21 03:58:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:25,184 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:25,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:25,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:58:25,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:25,187 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:25,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:25,188 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 10 [2022-02-21 03:58:25,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:25,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:58:25,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:58:25,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:58:25,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:25,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:25,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:25,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,203 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:58:25,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,204 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:58:25,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:25,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {370#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {370#unseeded} is VALID [2022-02-21 03:58:25,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {370#unseeded} is VALID [2022-02-21 03:58:25,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#unseeded} assume !!(main_~x~0#1 > -100); {370#unseeded} is VALID [2022-02-21 03:58:25,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {370#unseeded} assume !!(main_~x~0#1 < 200); {370#unseeded} is VALID [2022-02-21 03:58:25,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {370#unseeded} assume !!(main_~z~0#1 > 100); {370#unseeded} is VALID [2022-02-21 03:58:25,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#unseeded} assume !!(main_~z~0#1 < 200); {370#unseeded} is VALID [2022-02-21 03:58:25,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {370#unseeded} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {370#unseeded} is VALID [2022-02-21 03:58:25,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {370#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; {370#unseeded} is VALID [2022-02-21 03:58:25,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {370#unseeded} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {370#unseeded} is VALID [2022-02-21 03:58:25,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {370#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; {370#unseeded} is VALID [2022-02-21 03:58:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:25,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {373#(>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {475#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:58:25,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {383#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:58:25,276 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:58:25,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:25,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,281 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:25,281 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,302 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 25 transitions. Complement of second has 5 states. [2022-02-21 03:58:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:25,307 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:25,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:25,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:58:25,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,311 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:25,311 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:25,311 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:25,312 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 10 [2022-02-21 03:58:25,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:25,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:58:25,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:58:25,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:58:25,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:25,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:25,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:25,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,324 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:58:25,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,329 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:58:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:25,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {370#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {370#unseeded} is VALID [2022-02-21 03:58:25,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {370#unseeded} is VALID [2022-02-21 03:58:25,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#unseeded} assume !!(main_~x~0#1 > -100); {370#unseeded} is VALID [2022-02-21 03:58:25,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {370#unseeded} assume !!(main_~x~0#1 < 200); {370#unseeded} is VALID [2022-02-21 03:58:25,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {370#unseeded} assume !!(main_~z~0#1 > 100); {370#unseeded} is VALID [2022-02-21 03:58:25,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#unseeded} assume !!(main_~z~0#1 < 200); {370#unseeded} is VALID [2022-02-21 03:58:25,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {370#unseeded} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {370#unseeded} is VALID [2022-02-21 03:58:25,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {370#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; {370#unseeded} is VALID [2022-02-21 03:58:25,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {370#unseeded} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {370#unseeded} is VALID [2022-02-21 03:58:25,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {370#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; {370#unseeded} is VALID [2022-02-21 03:58:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:25,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {373#(>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {535#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:58:25,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#(and (< |ULTIMATE.start_main_~x~0#1| 100) (>= oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|))))} assume 0 != main_~tmp~0#1 % 256;main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {383#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 199 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:58:25,398 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:58:25,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:25,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,408 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:25,408 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,430 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 28 transitions. Complement of second has 4 states. [2022-02-21 03:58:25,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:25,431 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:25,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:25,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2022-02-21 03:58:25,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:58:25,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,438 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:25,438 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:25,438 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,440 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:25,440 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:58:25,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:25,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:58:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:58:25,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:58:25,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:25,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:25,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:25,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:58:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 28 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,454 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:58:25,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:58:25,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:58:25,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:58:25,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. cyclomatic complexity: 11 [2022-02-21 03:58:25,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:58:25,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 24 transitions. [2022-02-21 03:58:25,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:58:25,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:58:25,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2022-02-21 03:58:25,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:58:25,470 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 03:58:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2022-02-21 03:58:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 10. [2022-02-21 03:58:25,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:58:25,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,470 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,470 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,471 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:25,471 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2022-02-21 03:58:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-02-21 03:58:25,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:25,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:25,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 24 transitions. [2022-02-21 03:58:25,472 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 24 transitions. [2022-02-21 03:58:25,472 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:25,473 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2022-02-21 03:58:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-02-21 03:58:25,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:25,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:25,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:58:25,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:58:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2022-02-21 03:58:25,473 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:58:25,473 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:58:25,473 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:58:25,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:58:25,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:58:25,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,474 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:58:25,474 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:25,476 INFO L791 eck$LassoCheckResult]: Stem: 567#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 568#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 565#L22 assume !!(main_~x~0#1 > -100); 566#L23 assume !!(main_~x~0#1 < 200); 574#L24 assume !!(main_~z~0#1 > 100); 569#L25 assume !!(main_~z~0#1 < 200); 570#L29-2 [2022-02-21 03:58:25,476 INFO L793 eck$LassoCheckResult]: Loop: 570#L29-2 assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 571#L29 assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; 570#L29-2 [2022-02-21 03:58:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,477 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 2 times [2022-02-21 03:58:25,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:25,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790539711] [2022-02-21 03:58:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,494 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:25,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 1 times [2022-02-21 03:58:25,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:25,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854434821] [2022-02-21 03:58:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,506 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,508 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash 179567794, now seen corresponding path program 3 times [2022-02-21 03:58:25,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:25,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787659024] [2022-02-21 03:58:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,524 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:25,559 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:25,559 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:25,559 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:25,560 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:25,560 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:58:25,560 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,560 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:25,560 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:25,560 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration4_Loop [2022-02-21 03:58:25,560 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:25,560 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:25,561 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:58:25,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:25,567 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:58:25,570 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:58:25,572 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:58:25,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:25,650 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:58:25,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,652 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:58:25,676 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:58:25,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:25,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,691 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:58:25,700 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:25,700 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:58:25,718 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:58:25,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,720 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:58:25,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:25,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,734 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:58:25,757 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:58:25,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,758 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:58:25,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:58:25,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,781 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:58:25,783 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:25,783 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=99} Honda state: {ULTIMATE.start_main_~x~0#1=99} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=-1}, {ULTIMATE.start_main_~x~0#1=0}, {ULTIMATE.start_main_~x~0#1=0}] Lambdas: [1, 13, 8] Nus: [1, 1] [2022-02-21 03:58:25,801 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:58:25,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,802 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:58:25,803 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:58:25,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:25,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,831 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:25,832 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~tmp~0#1=0, ULTIMATE.start_main_#t~nondet6#1=0} Honda state: {ULTIMATE.start_main_~tmp~0#1=0, ULTIMATE.start_main_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:58:25,849 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:58:25,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,851 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:58:25,852 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:58:25,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:25,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,879 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:25,879 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:58:25,897 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:58:25,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,898 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:25,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:58:25,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:25,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:25,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,941 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:25,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:58:25,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:58:25,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,976 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:58:25,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:58:25,979 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:25,979 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:25,979 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:25,979 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:25,979 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:25,979 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,979 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:25,979 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:25,979 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration4_Loop [2022-02-21 03:58:25,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:25,980 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:25,980 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:58:25,987 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:58:25,991 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:58:25,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:25,996 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:58:26,096 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:26,096 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:58:26,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:26,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:26,098 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:26,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:58:26,100 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:58:26,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:26,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:26,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:26,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:26,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:26,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:26,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:26,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:26,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:26,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:26,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:26,140 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:26,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:58:26,142 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:58:26,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:26,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:26,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:26,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:26,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:26,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:26,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:26,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:26,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:26,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:26,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:26,170 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:26,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:58:26,172 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:58:26,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:26,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:26,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:26,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:26,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:26,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:26,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:26,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:26,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:58:26,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:26,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:26,206 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:26,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:58:26,208 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:58:26,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:26,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:26,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:26,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:26,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:26,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:26,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:26,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:26,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:26,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:26,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:26,237 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:26,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:58:26,239 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:58:26,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:26,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:26,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:26,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:26,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:26,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:26,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:26,247 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:26,249 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:58:26,249 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:58:26,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:26,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:26,251 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:26,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:58:26,254 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:26,254 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:58:26,254 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:26,254 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0#1) = 1*ULTIMATE.start_main_~z~0#1 Supporting invariants [] [2022-02-21 03:58:26,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:26,281 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:58:26,283 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1;" [2022-02-21 03:58:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:26,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {662#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {662#unseeded} is VALID [2022-02-21 03:58:26,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {662#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_~tmp~0#1, main_~x~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {662#unseeded} is VALID [2022-02-21 03:58:26,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {662#unseeded} assume !!(main_~x~0#1 > -100); {662#unseeded} is VALID [2022-02-21 03:58:26,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {662#unseeded} assume !!(main_~x~0#1 < 200); {662#unseeded} is VALID [2022-02-21 03:58:26,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {662#unseeded} assume !!(main_~z~0#1 > 100); {662#unseeded} is VALID [2022-02-21 03:58:26,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {662#unseeded} assume !!(main_~z~0#1 < 200); {662#unseeded} is VALID [2022-02-21 03:58:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:26,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#(>= oldRank0 |ULTIMATE.start_main_~z~0#1|)} assume !!(main_~x~0#1 < 100 && main_~z~0#1 > 100);main_~tmp~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {695#(and (>= oldRank0 |ULTIMATE.start_main_~z~0#1|) (< 100 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-21 03:58:26,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {695#(and (>= oldRank0 |ULTIMATE.start_main_~z~0#1|) (< 100 |ULTIMATE.start_main_~z~0#1|))} assume !(0 != main_~tmp~0#1 % 256);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;main_#t~post9#1 := main_~z~0#1;main_~z~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1; {675#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~z~0#1|)) unseeded)} is VALID [2022-02-21 03:58:26,351 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:58:26,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:26,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:26,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,357 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:26,357 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:26,371 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 4 states. [2022-02-21 03:58:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:26,371 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:26,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 3 [2022-02-21 03:58:26,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:26,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:26,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:26,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:26,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:26,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:26,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2022-02-21 03:58:26,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:26,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:26,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 3 [2022-02-21 03:58:26,373 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:26,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:26,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:26,373 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:26,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:26,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:26,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:26,373 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:58:26,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:58:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:58:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,376 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:58:26,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:58:26,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:58:26,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:58:26,377 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:26,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2022-02-21 03:58:26,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:58:26,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:58:26,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:58:26,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:58:26,378 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:26,378 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:26,378 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:26,378 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:58:26,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:58:26,378 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:26,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:26,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:58:26 BoogieIcfgContainer [2022-02-21 03:58:26,384 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:58:26,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:58:26,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:58:26,384 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:58:26,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:58:22" (3/4) ... [2022-02-21 03:58:26,386 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:58:26,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:58:26,387 INFO L158 Benchmark]: Toolchain (without parser) took 4204.03ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 75.5MB in the beginning and 73.7MB in the end (delta: 1.9MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-02-21 03:58:26,387 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 81.9MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:26,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.57ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 85.5MB in the end (delta: -10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:58:26,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.71ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 83.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:26,388 INFO L158 Benchmark]: Boogie Preprocessor took 31.16ms. Allocated memory is still 109.1MB. Free memory was 83.9MB in the beginning and 82.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:26,388 INFO L158 Benchmark]: RCFGBuilder took 253.50ms. Allocated memory is still 109.1MB. Free memory was 82.7MB in the beginning and 72.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:58:26,388 INFO L158 Benchmark]: BuchiAutomizer took 3666.13ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 71.8MB in the beginning and 74.7MB in the end (delta: -2.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-02-21 03:58:26,388 INFO L158 Benchmark]: Witness Printer took 2.05ms. Allocated memory is still 136.3MB. Free memory was 74.7MB in the beginning and 73.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:26,390 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.18ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 81.9MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.57ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 85.5MB in the end (delta: -10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.71ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 83.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.16ms. Allocated memory is still 109.1MB. Free memory was 83.9MB in the beginning and 82.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 253.50ms. Allocated memory is still 109.1MB. Free memory was 82.7MB in the beginning and 72.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3666.13ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 71.8MB in the beginning and 74.7MB in the end (delta: -2.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Witness Printer took 2.05ms. Allocated memory is still 136.3MB. Free memory was 74.7MB in the beginning and 73.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 199 + -2 * x and consists of 5 locations. One deterministic module has affine ranking function 199 + -2 * x and consists of 3 locations. One deterministic module has affine ranking function z and consists of 3 locations. One nondeterministic module has affine ranking function 199 + -2 * x and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 60 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp47 ukn100 mio100 lsp100 div444 bol100 ite100 ukn100 eq150 hnf95 smp41 dnf100 smp100 tf106 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:58:26,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:58:26,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE