./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/toy1.cil.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 c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 16:03:20,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:03:20,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:03:20,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:03:20,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:03:20,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:03:20,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:03:21,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:03:21,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:03:21,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:03:21,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:03:21,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:03:21,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:03:21,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:03:21,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:03:21,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:03:21,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:03:21,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:03:21,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:03:21,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:03:21,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:03:21,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:03:21,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:03:21,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:03:21,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:03:21,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:03:21,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:03:21,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:03:21,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:03:21,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:03:21,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:03:21,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:03:21,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:03:21,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:03:21,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:03:21,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:03:21,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:03:21,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:03:21,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:03:21,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:03:21,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:03:21,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:03:21,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:03:21,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:03:21,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:03:21,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:03:21,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:03:21,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:03:21,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:03:21,068 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:03:21,068 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:03:21,069 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:03:21,069 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:03:21,069 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:03:21,070 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:03:21,070 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:03:21,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:03:21,070 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:03:21,070 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:03:21,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:03:21,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:03:21,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:03:21,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:03:21,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:03:21,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:03:21,071 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:03:21,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:03:21,071 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:03:21,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:03:21,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:03:21,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:03:21,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:03:21,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:03:21,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:03:21,073 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:03:21,074 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 -> c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a [2022-07-14 16:03:21,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:03:21,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:03:21,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:03:21,296 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:03:21,297 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:03:21,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2022-07-14 16:03:21,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40609cd9e/623cfd34b7f9428eb669175a48657fcd/FLAG73e08918c [2022-07-14 16:03:21,715 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:03:21,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2022-07-14 16:03:21,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40609cd9e/623cfd34b7f9428eb669175a48657fcd/FLAG73e08918c [2022-07-14 16:03:22,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40609cd9e/623cfd34b7f9428eb669175a48657fcd [2022-07-14 16:03:22,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:03:22,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:03:22,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:03:22,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:03:22,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:03:22,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e137d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22, skipping insertion in model container [2022-07-14 16:03:22,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:03:22,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:03:22,283 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/systemc/toy1.cil.c[698,711] [2022-07-14 16:03:22,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:03:22,366 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:03:22,375 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/systemc/toy1.cil.c[698,711] [2022-07-14 16:03:22,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:03:22,431 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:03:22,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22 WrapperNode [2022-07-14 16:03:22,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:03:22,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:03:22,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:03:22,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:03:22,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,484 INFO L137 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 363 [2022-07-14 16:03:22,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:03:22,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:03:22,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:03:22,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:03:22,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:03:22,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:03:22,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:03:22,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:03:22,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (1/1) ... [2022-07-14 16:03:22,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:22,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:22,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:22,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 16:03:22,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 16:03:22,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 16:03:22,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:03:22,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:03:22,744 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:03:22,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:03:22,977 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:03:22,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:03:22,983 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-14 16:03:22,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:03:22 BoogieIcfgContainer [2022-07-14 16:03:22,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:03:22,986 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:03:22,986 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:03:22,988 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:03:22,989 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:03:22,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:03:22" (1/3) ... [2022-07-14 16:03:22,990 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60ba8de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:03:22, skipping insertion in model container [2022-07-14 16:03:22,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:03:22,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:22" (2/3) ... [2022-07-14 16:03:22,990 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60ba8de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:03:22, skipping insertion in model container [2022-07-14 16:03:22,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:03:22,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:03:22" (3/3) ... [2022-07-14 16:03:22,992 INFO L354 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2022-07-14 16:03:23,030 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:03:23,031 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:03:23,031 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:03:23,031 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:03:23,031 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:03:23,031 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:03:23,031 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:03:23,031 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:03:23,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 134 states, 133 states have (on average 1.8195488721804511) internal successors, (242), 133 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2022-07-14 16:03:23,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:23,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:23,060 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,060 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,060 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:03:23,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 134 states, 133 states have (on average 1.8195488721804511) internal successors, (242), 133 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2022-07-14 16:03:23,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:23,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:23,068 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,068 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,073 INFO L752 eck$LassoCheckResult]: Stem: 122#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 45#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 20#L416true assume !(1 == ~c_req_up~0); 111#L416-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 61#L427-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 70#L432-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 32#L437-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 44#L442-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 107#L447-1true assume !(0 == ~e_f~0); 35#L452-1true assume !(0 == ~e_g~0); 8#L457-1true assume !(0 == ~e_e~0); 119#L462-1true assume !(0 == ~e_c~0); 24#L467-1true assume !(0 == ~e_wl~0); 100#L472-1true assume !(1 == ~wl_pc~0); 124#L484true assume !(2 == ~wl_pc~0); 93#L485true assume !(1 == ~c1_pc~0); 25#L495true assume !(1 == ~c2_pc~0); 74#L504true assume !(1 == ~wb_pc~0); 97#L513true assume !(1 == ~e_c~0); 16#L522-1true assume !(1 == ~e_e~0); 105#L527-1true assume !(1 == ~e_f~0); 37#L532-1true assume !(1 == ~e_g~0); 84#L537-1true assume !(1 == ~e_c~0); 55#L542-1true assume !(1 == ~e_wl~0); 102#L684-1true [2022-07-14 16:03:23,073 INFO L754 eck$LassoCheckResult]: Loop: 102#L684-1true assume !false; 133#L554true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 18#L389true assume false; 77#L405true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 23#L560true assume !(1 == ~c_req_up~0); 99#L560-2true start_simulation_~kernel_st~0#1 := 3; 108#L572true assume 0 == ~e_f~0;~e_f~0 := 1; 22#L572-2true assume 0 == ~e_g~0;~e_g~0 := 1; 48#L577-1true assume !(0 == ~e_e~0); 33#L582-1true assume 0 == ~e_c~0;~e_c~0 := 1; 41#L587-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 56#L592-1true assume !(1 == ~wl_pc~0); 49#L604true assume !(2 == ~wl_pc~0); 57#L605true assume !(1 == ~c1_pc~0); 7#L615true assume !(1 == ~c2_pc~0); 46#L624true assume !(1 == ~wb_pc~0); 126#L633true assume 1 == ~e_c~0;~r_st~0 := 0; 87#L642-1true assume 1 == ~e_e~0;~e_e~0 := 2; 26#L647-1true assume 1 == ~e_f~0;~e_f~0 := 2; 12#L652-1true assume !(1 == ~e_g~0); 88#L657-1true assume 1 == ~e_c~0;~e_c~0 := 2; 80#L662-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 103#L667-1true assume 0 == ~wl_st~0; 102#L684-1true [2022-07-14 16:03:23,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2022-07-14 16:03:23,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687554133] [2022-07-14 16:03:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687554133] [2022-07-14 16:03:23,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687554133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:23,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131577983] [2022-07-14 16:03:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,219 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:23,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash -696614142, now seen corresponding path program 1 times [2022-07-14 16:03:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717978466] [2022-07-14 16:03:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717978466] [2022-07-14 16:03:23,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717978466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 16:03:23,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249898118] [2022-07-14 16:03:23,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,234 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:23,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 16:03:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 16:03:23,256 INFO L87 Difference]: Start difference. First operand has 134 states, 133 states have (on average 1.8195488721804511) internal successors, (242), 133 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:23,267 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2022-07-14 16:03:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 16:03:23,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. [2022-07-14 16:03:23,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:23,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 126 states and 220 transitions. [2022-07-14 16:03:23,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-07-14 16:03:23,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-07-14 16:03:23,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 220 transitions. [2022-07-14 16:03:23,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:23,279 INFO L369 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2022-07-14 16:03:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 220 transitions. [2022-07-14 16:03:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-14 16:03:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.746031746031746) internal successors, (220), 125 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 220 transitions. [2022-07-14 16:03:23,300 INFO L392 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2022-07-14 16:03:23,300 INFO L374 stractBuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2022-07-14 16:03:23,300 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:03:23,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 220 transitions. [2022-07-14 16:03:23,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:23,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:23,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:23,303 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,303 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,304 INFO L752 eck$LassoCheckResult]: Stem: 400#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 309#L416 assume !(1 == ~c_req_up~0); 311#L416-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 369#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 370#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 334#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 335#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 352#L447-1 assume !(0 == ~e_f~0); 340#L452-1 assume !(0 == ~e_g~0); 287#L457-1 assume !(0 == ~e_e~0); 288#L462-1 assume !(0 == ~e_c~0); 319#L467-1 assume !(0 == ~e_wl~0); 320#L472-1 assume !(1 == ~wl_pc~0); 395#L484 assume !(2 == ~wl_pc~0); 391#L485 assume !(1 == ~c1_pc~0); 321#L495 assume !(1 == ~c2_pc~0); 323#L504 assume !(1 == ~wb_pc~0); 379#L513 assume !(1 == ~e_c~0); 300#L522-1 assume !(1 == ~e_e~0); 301#L527-1 assume !(1 == ~e_f~0); 341#L532-1 assume !(1 == ~e_g~0); 342#L537-1 assume !(1 == ~e_c~0); 363#L542-1 assume !(1 == ~e_wl~0); 278#L684-1 [2022-07-14 16:03:23,304 INFO L754 eck$LassoCheckResult]: Loop: 278#L684-1 assume !false; 397#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 305#L389 assume !false; 306#L307 assume !(0 == ~wl_st~0); 358#L311 assume !(0 == ~c1_st~0); 359#L314 assume !(0 == ~c2_st~0); 279#L317 assume !(0 == ~wb_st~0); 281#L320 assume !(0 == ~r_st~0); 382#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 316#L560 assume !(1 == ~c_req_up~0); 318#L560-2 start_simulation_~kernel_st~0#1 := 3; 394#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 315#L577-1 assume !(0 == ~e_e~0); 336#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 337#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 349#L592-1 assume !(1 == ~wl_pc~0); 357#L604 assume !(2 == ~wl_pc~0); 308#L605 assume !(1 == ~c1_pc~0); 284#L615 assume !(1 == ~c2_pc~0); 286#L624 assume !(1 == ~wb_pc~0); 355#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 388#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 324#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 294#L652-1 assume !(1 == ~e_g~0); 295#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 385#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 386#L667-1 assume 0 == ~wl_st~0; 278#L684-1 [2022-07-14 16:03:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2022-07-14 16:03:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967396539] [2022-07-14 16:03:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967396539] [2022-07-14 16:03:23,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967396539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:23,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102036708] [2022-07-14 16:03:23,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,333 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1432587772, now seen corresponding path program 1 times [2022-07-14 16:03:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042304651] [2022-07-14 16:03:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042304651] [2022-07-14 16:03:23,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042304651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:23,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335304312] [2022-07-14 16:03:23,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,379 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:23,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:23,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:23,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:23,380 INFO L87 Difference]: Start difference. First operand 126 states and 220 transitions. cyclomatic complexity: 95 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:23,398 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2022-07-14 16:03:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:23,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 219 transitions. [2022-07-14 16:03:23,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:23,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 219 transitions. [2022-07-14 16:03:23,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-07-14 16:03:23,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-07-14 16:03:23,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 219 transitions. [2022-07-14 16:03:23,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:23,403 INFO L369 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2022-07-14 16:03:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 219 transitions. [2022-07-14 16:03:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-14 16:03:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7380952380952381) internal successors, (219), 125 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 219 transitions. [2022-07-14 16:03:23,408 INFO L392 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2022-07-14 16:03:23,408 INFO L374 stractBuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2022-07-14 16:03:23,408 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:03:23,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 219 transitions. [2022-07-14 16:03:23,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:23,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:23,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:23,413 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,413 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,413 INFO L752 eck$LassoCheckResult]: Stem: 659#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 568#L416 assume !(1 == ~c_req_up~0); 570#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 628#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 629#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 593#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 594#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 611#L447-1 assume !(0 == ~e_f~0); 599#L452-1 assume !(0 == ~e_g~0); 546#L457-1 assume !(0 == ~e_e~0); 547#L462-1 assume !(0 == ~e_c~0); 578#L467-1 assume !(0 == ~e_wl~0); 579#L472-1 assume !(1 == ~wl_pc~0); 654#L484 assume !(2 == ~wl_pc~0); 650#L485 assume !(1 == ~c1_pc~0); 580#L495 assume !(1 == ~c2_pc~0); 582#L504 assume !(1 == ~wb_pc~0); 638#L513 assume !(1 == ~e_c~0); 559#L522-1 assume !(1 == ~e_e~0); 560#L527-1 assume !(1 == ~e_f~0); 600#L532-1 assume !(1 == ~e_g~0); 601#L537-1 assume !(1 == ~e_c~0); 622#L542-1 assume !(1 == ~e_wl~0); 537#L684-1 [2022-07-14 16:03:23,413 INFO L754 eck$LassoCheckResult]: Loop: 537#L684-1 assume !false; 656#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 564#L389 assume !false; 565#L307 assume !(0 == ~wl_st~0); 617#L311 assume !(0 == ~c1_st~0); 618#L314 assume !(0 == ~c2_st~0); 538#L317 assume !(0 == ~wb_st~0); 540#L320 assume !(0 == ~r_st~0); 641#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 575#L560 assume !(1 == ~c_req_up~0); 577#L560-2 start_simulation_~kernel_st~0#1 := 3; 653#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 573#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 574#L577-1 assume !(0 == ~e_e~0); 595#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 596#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 608#L592-1 assume !(1 == ~wl_pc~0); 616#L604 assume !(2 == ~wl_pc~0); 567#L605 assume !(1 == ~c1_pc~0); 543#L615 assume !(1 == ~c2_pc~0); 545#L624 assume !(1 == ~wb_pc~0); 614#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 647#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 583#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 553#L652-1 assume !(1 == ~e_g~0); 554#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 644#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 645#L667-1 assume 0 == ~wl_st~0; 537#L684-1 [2022-07-14 16:03:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2022-07-14 16:03:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001545464] [2022-07-14 16:03:23,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001545464] [2022-07-14 16:03:23,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001545464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108995061] [2022-07-14 16:03:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,438 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1432587772, now seen corresponding path program 2 times [2022-07-14 16:03:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853709564] [2022-07-14 16:03:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853709564] [2022-07-14 16:03:23,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853709564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765196967] [2022-07-14 16:03:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,458 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:23,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:23,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:23,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:23,459 INFO L87 Difference]: Start difference. First operand 126 states and 219 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:23,470 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2022-07-14 16:03:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:23,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 218 transitions. [2022-07-14 16:03:23,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:23,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 218 transitions. [2022-07-14 16:03:23,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-07-14 16:03:23,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-07-14 16:03:23,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 218 transitions. [2022-07-14 16:03:23,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:23,474 INFO L369 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2022-07-14 16:03:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 218 transitions. [2022-07-14 16:03:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-14 16:03:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7301587301587302) internal successors, (218), 125 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 218 transitions. [2022-07-14 16:03:23,479 INFO L392 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2022-07-14 16:03:23,479 INFO L374 stractBuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2022-07-14 16:03:23,479 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:03:23,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 218 transitions. [2022-07-14 16:03:23,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:23,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:23,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:23,481 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,481 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,482 INFO L752 eck$LassoCheckResult]: Stem: 918#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 871#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 827#L416 assume !(1 == ~c_req_up~0); 829#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 887#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 888#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 854#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 855#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 870#L447-1 assume !(0 == ~e_f~0); 858#L452-1 assume !(0 == ~e_g~0); 805#L457-1 assume !(0 == ~e_e~0); 806#L462-1 assume !(0 == ~e_c~0); 837#L467-1 assume !(0 == ~e_wl~0); 838#L472-1 assume !(1 == ~wl_pc~0); 913#L484 assume !(2 == ~wl_pc~0); 909#L485 assume !(1 == ~c1_pc~0); 839#L495 assume !(1 == ~c2_pc~0); 841#L504 assume !(1 == ~wb_pc~0); 897#L513 assume !(1 == ~e_c~0); 818#L522-1 assume !(1 == ~e_e~0); 819#L527-1 assume !(1 == ~e_f~0); 859#L532-1 assume !(1 == ~e_g~0); 860#L537-1 assume !(1 == ~e_c~0); 881#L542-1 assume !(1 == ~e_wl~0); 796#L684-1 [2022-07-14 16:03:23,482 INFO L754 eck$LassoCheckResult]: Loop: 796#L684-1 assume !false; 915#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 823#L389 assume !false; 824#L307 assume !(0 == ~wl_st~0); 876#L311 assume !(0 == ~c1_st~0); 877#L314 assume !(0 == ~c2_st~0); 797#L317 assume !(0 == ~wb_st~0); 799#L320 assume !(0 == ~r_st~0); 900#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 834#L560 assume !(1 == ~c_req_up~0); 836#L560-2 start_simulation_~kernel_st~0#1 := 3; 912#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 832#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 833#L577-1 assume !(0 == ~e_e~0); 852#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 853#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 867#L592-1 assume 1 == ~wl_pc~0; 882#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 826#L605 assume !(1 == ~c1_pc~0); 802#L615 assume !(1 == ~c2_pc~0); 804#L624 assume !(1 == ~wb_pc~0); 873#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 906#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 842#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 812#L652-1 assume !(1 == ~e_g~0); 813#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 903#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 904#L667-1 assume 0 == ~wl_st~0; 796#L684-1 [2022-07-14 16:03:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2022-07-14 16:03:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197313312] [2022-07-14 16:03:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197313312] [2022-07-14 16:03:23,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197313312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:23,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908519052] [2022-07-14 16:03:23,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,506 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 883328051, now seen corresponding path program 1 times [2022-07-14 16:03:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290372507] [2022-07-14 16:03:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290372507] [2022-07-14 16:03:23,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290372507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146354856] [2022-07-14 16:03:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,524 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:23,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:23,525 INFO L87 Difference]: Start difference. First operand 126 states and 218 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:23,535 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2022-07-14 16:03:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:23,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 217 transitions. [2022-07-14 16:03:23,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:23,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 217 transitions. [2022-07-14 16:03:23,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-07-14 16:03:23,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-07-14 16:03:23,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 217 transitions. [2022-07-14 16:03:23,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:23,538 INFO L369 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2022-07-14 16:03:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 217 transitions. [2022-07-14 16:03:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-14 16:03:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 217 transitions. [2022-07-14 16:03:23,558 INFO L392 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2022-07-14 16:03:23,558 INFO L374 stractBuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2022-07-14 16:03:23,558 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 16:03:23,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 217 transitions. [2022-07-14 16:03:23,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:23,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:23,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:23,560 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,560 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,560 INFO L752 eck$LassoCheckResult]: Stem: 1177#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1086#L416 assume !(1 == ~c_req_up~0); 1088#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1146#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1147#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1113#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1114#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1129#L447-1 assume !(0 == ~e_f~0); 1117#L452-1 assume !(0 == ~e_g~0); 1064#L457-1 assume !(0 == ~e_e~0); 1065#L462-1 assume !(0 == ~e_c~0); 1096#L467-1 assume !(0 == ~e_wl~0); 1097#L472-1 assume !(1 == ~wl_pc~0); 1172#L484 assume !(2 == ~wl_pc~0); 1168#L485 assume !(1 == ~c1_pc~0); 1098#L495 assume !(1 == ~c2_pc~0); 1100#L504 assume !(1 == ~wb_pc~0); 1156#L513 assume !(1 == ~e_c~0); 1077#L522-1 assume !(1 == ~e_e~0); 1078#L527-1 assume !(1 == ~e_f~0); 1118#L532-1 assume !(1 == ~e_g~0); 1119#L537-1 assume !(1 == ~e_c~0); 1140#L542-1 assume !(1 == ~e_wl~0); 1055#L684-1 [2022-07-14 16:03:23,560 INFO L754 eck$LassoCheckResult]: Loop: 1055#L684-1 assume !false; 1174#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1082#L389 assume !false; 1083#L307 assume !(0 == ~wl_st~0); 1135#L311 assume !(0 == ~c1_st~0); 1136#L314 assume !(0 == ~c2_st~0); 1056#L317 assume !(0 == ~wb_st~0); 1058#L320 assume !(0 == ~r_st~0); 1159#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1093#L560 assume !(1 == ~c_req_up~0); 1095#L560-2 start_simulation_~kernel_st~0#1 := 3; 1171#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1091#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1092#L577-1 assume !(0 == ~e_e~0); 1111#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1112#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1126#L592-1 assume 1 == ~wl_pc~0; 1141#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1085#L605 assume !(1 == ~c1_pc~0); 1061#L615 assume !(1 == ~c2_pc~0); 1063#L624 assume !(1 == ~wb_pc~0); 1132#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1165#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1101#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1071#L652-1 assume !(1 == ~e_g~0); 1072#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1162#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1163#L667-1 assume 0 == ~wl_st~0; 1055#L684-1 [2022-07-14 16:03:23,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2022-07-14 16:03:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941166528] [2022-07-14 16:03:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:23,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:23,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 883328051, now seen corresponding path program 2 times [2022-07-14 16:03:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670907263] [2022-07-14 16:03:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670907263] [2022-07-14 16:03:23,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670907263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:23,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975416289] [2022-07-14 16:03:23,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,659 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:23,661 INFO L87 Difference]: Start difference. First operand 126 states and 217 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:23,707 INFO L93 Difference]: Finished difference Result 160 states and 279 transitions. [2022-07-14 16:03:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:23,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 279 transitions. [2022-07-14 16:03:23,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2022-07-14 16:03:23,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 279 transitions. [2022-07-14 16:03:23,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2022-07-14 16:03:23,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2022-07-14 16:03:23,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 279 transitions. [2022-07-14 16:03:23,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:23,711 INFO L369 hiAutomatonCegarLoop]: Abstraction has 160 states and 279 transitions. [2022-07-14 16:03:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 279 transitions. [2022-07-14 16:03:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-14 16:03:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 160 states have (on average 1.74375) internal successors, (279), 159 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 279 transitions. [2022-07-14 16:03:23,716 INFO L392 hiAutomatonCegarLoop]: Abstraction has 160 states and 279 transitions. [2022-07-14 16:03:23,716 INFO L374 stractBuchiCegarLoop]: Abstraction has 160 states and 279 transitions. [2022-07-14 16:03:23,716 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 16:03:23,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 279 transitions. [2022-07-14 16:03:23,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2022-07-14 16:03:23,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:23,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:23,718 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,718 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,719 INFO L752 eck$LassoCheckResult]: Stem: 1473#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1378#L416 assume !(1 == ~c_req_up~0); 1380#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1441#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1442#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1406#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1407#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1424#L447-1 assume !(0 == ~e_f~0); 1410#L452-1 assume 0 == ~e_g~0;~e_g~0 := 1; 1411#L457-1 assume !(0 == ~e_e~0); 1502#L462-1 assume !(0 == ~e_c~0); 1501#L467-1 assume !(0 == ~e_wl~0); 1500#L472-1 assume !(1 == ~wl_pc~0); 1498#L484 assume !(2 == ~wl_pc~0); 1496#L485 assume !(1 == ~c1_pc~0); 1391#L495 assume !(1 == ~c2_pc~0); 1393#L504 assume !(1 == ~wb_pc~0); 1451#L513 assume !(1 == ~e_c~0); 1369#L522-1 assume !(1 == ~e_e~0); 1370#L527-1 assume !(1 == ~e_f~0); 1412#L532-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1413#L537-1 assume !(1 == ~e_c~0); 1435#L542-1 assume !(1 == ~e_wl~0); 1347#L684-1 [2022-07-14 16:03:23,719 INFO L754 eck$LassoCheckResult]: Loop: 1347#L684-1 assume !false; 1470#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1374#L389 assume !false; 1375#L307 assume !(0 == ~wl_st~0); 1430#L311 assume !(0 == ~c1_st~0); 1431#L314 assume !(0 == ~c2_st~0); 1348#L317 assume !(0 == ~wb_st~0); 1350#L320 assume !(0 == ~r_st~0); 1454#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1386#L560 assume !(1 == ~c_req_up~0); 1388#L560-2 start_simulation_~kernel_st~0#1 := 3; 1466#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1383#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1384#L577-1 assume !(0 == ~e_e~0); 1503#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1420#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1421#L592-1 assume !(1 == ~wl_pc~0); 1429#L604 assume !(2 == ~wl_pc~0); 1377#L605 assume !(1 == ~c1_pc~0); 1353#L615 assume !(1 == ~c2_pc~0); 1355#L624 assume !(1 == ~wb_pc~0); 1427#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1461#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1394#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1363#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1364#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1457#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1458#L667-1 assume 0 == ~wl_st~0; 1347#L684-1 [2022-07-14 16:03:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1535466835, now seen corresponding path program 1 times [2022-07-14 16:03:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163398312] [2022-07-14 16:03:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163398312] [2022-07-14 16:03:23,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163398312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 16:03:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787419898] [2022-07-14 16:03:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,760 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1432528190, now seen corresponding path program 1 times [2022-07-14 16:03:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960946965] [2022-07-14 16:03:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960946965] [2022-07-14 16:03:23,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960946965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 16:03:23,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982036202] [2022-07-14 16:03:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,776 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 16:03:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 16:03:23,777 INFO L87 Difference]: Start difference. First operand 160 states and 279 transitions. cyclomatic complexity: 120 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:23,865 INFO L93 Difference]: Finished difference Result 226 states and 380 transitions. [2022-07-14 16:03:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:03:23,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 380 transitions. [2022-07-14 16:03:23,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2022-07-14 16:03:23,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 380 transitions. [2022-07-14 16:03:23,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2022-07-14 16:03:23,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2022-07-14 16:03:23,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 380 transitions. [2022-07-14 16:03:23,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:23,869 INFO L369 hiAutomatonCegarLoop]: Abstraction has 226 states and 380 transitions. [2022-07-14 16:03:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 380 transitions. [2022-07-14 16:03:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 215. [2022-07-14 16:03:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 215 states have (on average 1.697674418604651) internal successors, (365), 214 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 365 transitions. [2022-07-14 16:03:23,875 INFO L392 hiAutomatonCegarLoop]: Abstraction has 215 states and 365 transitions. [2022-07-14 16:03:23,875 INFO L374 stractBuchiCegarLoop]: Abstraction has 215 states and 365 transitions. [2022-07-14 16:03:23,875 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 16:03:23,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 365 transitions. [2022-07-14 16:03:23,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2022-07-14 16:03:23,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:23,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:23,877 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,877 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:23,878 INFO L752 eck$LassoCheckResult]: Stem: 1869#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1818#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1776#L416 assume !(1 == ~c_req_up~0); 1778#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1834#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1835#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1801#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1802#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1817#L447-1 assume !(0 == ~e_f~0); 1808#L452-1 assume !(0 == ~e_g~0); 1752#L457-1 assume !(0 == ~e_e~0); 1753#L462-1 assume !(0 == ~e_c~0); 1784#L467-1 assume !(0 == ~e_wl~0); 1785#L472-1 assume !(1 == ~wl_pc~0); 1862#L484 assume !(2 == ~wl_pc~0); 1858#L485 assume !(1 == ~c1_pc~0); 1786#L495 assume !(1 == ~c2_pc~0); 1788#L504 assume !(1 == ~wb_pc~0); 1844#L513 assume !(1 == ~e_c~0); 1876#L522-1 assume !(1 == ~e_e~0); 1874#L527-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1873#L532-1 assume !(1 == ~e_g~0); 1806#L537-1 assume !(1 == ~e_c~0); 1828#L542-1 assume !(1 == ~e_wl~0); 1746#L684-1 [2022-07-14 16:03:23,878 INFO L754 eck$LassoCheckResult]: Loop: 1746#L684-1 assume !false; 1864#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1770#L389 assume !false; 1771#L307 assume !(0 == ~wl_st~0); 1823#L311 assume !(0 == ~c1_st~0); 1824#L314 assume !(0 == ~c2_st~0); 1742#L317 assume !(0 == ~wb_st~0); 1744#L320 assume !(0 == ~r_st~0); 1848#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1781#L560 assume !(1 == ~c_req_up~0); 1783#L560-2 start_simulation_~kernel_st~0#1 := 3; 1860#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1779#L572-2 assume !(0 == ~e_g~0); 1780#L577-1 assume !(0 == ~e_e~0); 1799#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1800#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1814#L592-1 assume 1 == ~wl_pc~0; 1829#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1773#L605 assume !(1 == ~c1_pc~0); 1749#L615 assume !(1 == ~c2_pc~0); 1751#L624 assume !(1 == ~wb_pc~0); 1820#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1870#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1872#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1871#L652-1 assume !(1 == ~e_g~0); 1760#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1851#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1852#L667-1 assume 0 == ~wl_st~0; 1746#L684-1 [2022-07-14 16:03:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2022-07-14 16:03:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028814274] [2022-07-14 16:03:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:23,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:23,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028814274] [2022-07-14 16:03:23,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028814274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:23,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:23,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 16:03:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887651926] [2022-07-14 16:03:23,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:23,911 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash -137740303, now seen corresponding path program 1 times [2022-07-14 16:03:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:23,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537238461] [2022-07-14 16:03:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:23,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:23,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:24,174 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:24,175 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:24,175 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:24,175 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:24,175 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:03:24,175 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:24,175 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:24,175 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:24,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2022-07-14 16:03:24,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:24,176 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:24,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,425 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:24,425 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:03:24,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:24,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:24,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:24,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 16:03:24,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:24,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:24,454 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:24,454 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:24,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-14 16:03:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:24,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:24,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 16:03:24,476 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:24,476 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:24,487 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:24,487 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:24,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:24,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:24,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:24,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:24,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 16:03:24,523 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:24,523 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:24,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:24,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:24,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:24,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:24,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 16:03:24,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:03:24,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:24,611 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:03:24,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:24,658 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:24,658 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:24,658 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:24,658 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:24,658 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:03:24,658 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:24,658 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:24,658 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:24,658 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2022-07-14 16:03:24,658 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:24,658 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:24,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:24,920 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:24,924 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:03:24,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:24,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:24,926 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:24,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 16:03:24,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:24,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:24,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:24,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:24,935 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:24,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:24,937 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:24,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:24,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:24,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-14 16:03:24,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:24,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:24,965 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:24,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 16:03:24,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:24,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:24,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:24,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:24,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:24,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:24,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:24,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:24,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:03:24,998 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:03:24,998 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:03:24,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:24,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:25,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:25,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:03:25,017 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:03:25,017 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:03:25,017 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2022-07-14 16:03:25,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 16:03:25,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:25,051 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:03:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:25,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:03:25,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:25,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:03:25,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:25,181 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-14 16:03:25,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 365 transitions. cyclomatic complexity: 152 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:25,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 365 transitions. cyclomatic complexity: 152. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 758 states and 1283 transitions. Complement of second has 5 states. [2022-07-14 16:03:25,231 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-07-14 16:03:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2022-07-14 16:03:25,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2022-07-14 16:03:25,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:25,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2022-07-14 16:03:25,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:25,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2022-07-14 16:03:25,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:25,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 758 states and 1283 transitions. [2022-07-14 16:03:25,241 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 531 [2022-07-14 16:03:25,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 758 states to 758 states and 1283 transitions. [2022-07-14 16:03:25,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 571 [2022-07-14 16:03:25,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2022-07-14 16:03:25,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 758 states and 1283 transitions. [2022-07-14 16:03:25,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:25,245 INFO L369 hiAutomatonCegarLoop]: Abstraction has 758 states and 1283 transitions. [2022-07-14 16:03:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states and 1283 transitions. [2022-07-14 16:03:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 575. [2022-07-14 16:03:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 575 states have (on average 1.6956521739130435) internal successors, (975), 574 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 975 transitions. [2022-07-14 16:03:25,256 INFO L392 hiAutomatonCegarLoop]: Abstraction has 575 states and 975 transitions. [2022-07-14 16:03:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:25,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 16:03:25,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 16:03:25,257 INFO L87 Difference]: Start difference. First operand 575 states and 975 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:25,320 INFO L93 Difference]: Finished difference Result 1195 states and 1962 transitions. [2022-07-14 16:03:25,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 16:03:25,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1195 states and 1962 transitions. [2022-07-14 16:03:25,327 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 732 [2022-07-14 16:03:25,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1195 states to 1195 states and 1962 transitions. [2022-07-14 16:03:25,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 818 [2022-07-14 16:03:25,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 818 [2022-07-14 16:03:25,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1195 states and 1962 transitions. [2022-07-14 16:03:25,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:25,333 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1195 states and 1962 transitions. [2022-07-14 16:03:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states and 1962 transitions. [2022-07-14 16:03:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1174. [2022-07-14 16:03:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1174 states have (on average 1.6507666098807496) internal successors, (1938), 1173 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1938 transitions. [2022-07-14 16:03:25,348 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1174 states and 1938 transitions. [2022-07-14 16:03:25,349 INFO L374 stractBuchiCegarLoop]: Abstraction has 1174 states and 1938 transitions. [2022-07-14 16:03:25,349 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 16:03:25,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1174 states and 1938 transitions. [2022-07-14 16:03:25,352 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 730 [2022-07-14 16:03:25,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:25,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:25,353 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:25,353 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:25,354 INFO L752 eck$LassoCheckResult]: Stem: 4948#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4814#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 4729#L416 assume !(1 == ~c_req_up~0); 4731#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4988#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4987#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4986#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4985#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4984#L447-1 assume !(0 == ~e_f~0); 4983#L452-1 assume !(0 == ~e_g~0); 4982#L457-1 assume !(0 == ~e_e~0); 4981#L462-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4748#L467-1 assume !(0 == ~e_wl~0); 4749#L472-1 assume !(1 == ~wl_pc~0); 4929#L484 assume !(2 == ~wl_pc~0); 4919#L485 assume !(1 == ~c1_pc~0); 4899#L495 assume !(1 == ~c2_pc~0); 4881#L504 assume !(1 == ~wb_pc~0); 4882#L513 assume !(1 == ~e_c~0); 4972#L522-1 assume !(1 == ~e_e~0); 4969#L527-1 assume !(1 == ~e_f~0); 4966#L532-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4792#L537-1 assume !(1 == ~e_c~0); 5089#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4669#L684-1 [2022-07-14 16:03:25,354 INFO L754 eck$LassoCheckResult]: Loop: 4669#L684-1 assume !false; 5325#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 5322#L389 assume !false; 5319#L307 assume !(0 == ~wl_st~0); 5316#L311 assume !(0 == ~c1_st~0); 5312#L314 assume !(0 == ~c2_st~0); 5313#L317 assume !(0 == ~wb_st~0); 5302#L320 assume !(0 == ~r_st~0); 5298#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 5299#L560 assume !(1 == ~c_req_up~0); 5282#L560-2 start_simulation_~kernel_st~0#1 := 3; 5283#L572 assume !(0 == ~e_f~0); 5690#L572-2 assume !(0 == ~e_g~0); 5689#L577-1 assume !(0 == ~e_e~0); 5683#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4779#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5680#L592-1 assume 1 == ~wl_pc~0; 5681#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 5829#L605 assume !(1 == ~c1_pc~0); 5418#L615 assume !(1 == ~c2_pc~0); 5257#L624 assume !(1 == ~wb_pc~0); 5826#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 5825#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 5824#L647-1 assume !(1 == ~e_f~0); 5246#L652-1 assume !(1 == ~e_g~0); 4701#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4894#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4895#L667-1 assume 0 == ~wl_st~0; 4669#L684-1 [2022-07-14 16:03:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash 842409169, now seen corresponding path program 1 times [2022-07-14 16:03:25,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:25,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318956936] [2022-07-14 16:03:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:25,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:25,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318956936] [2022-07-14 16:03:25,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318956936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:25,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:25,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 16:03:25,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342153435] [2022-07-14 16:03:25,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:25,371 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1724241163, now seen corresponding path program 1 times [2022-07-14 16:03:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:25,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908634039] [2022-07-14 16:03:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:25,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:25,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:25,551 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:25,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:25,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:25,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:25,552 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:03:25,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:25,552 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:25,552 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:25,552 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2022-07-14 16:03:25,552 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:25,552 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:25,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03: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-07-14 16:03:25,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03: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-07-14 16:03:25,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03: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-07-14 16:03:25,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:25,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:25,807 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:25,807 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:03:25,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:25,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:25,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:25,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 16:03:25,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:25,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:25,839 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:25,840 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:25,884 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-07-14 16:03:25,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:25,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:25,886 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:25,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 16:03:25,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:25,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:25,911 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:25,912 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:25,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:25,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:25,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:25,942 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:25,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 16:03:25,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:25,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:25,967 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:25,967 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:25,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:25,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:25,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:25,990 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:25,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 16:03:25,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:25,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:26,004 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:26,004 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:26,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-14 16:03:26,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,021 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 16:03:26,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:26,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:26,034 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:26,034 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:26,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:26,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,050 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 16:03:26,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:26,053 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:26,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:26,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,098 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 16:03:26,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:03:26,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:26,108 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:03:26,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-14 16:03:26,126 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:26,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:26,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:26,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:26,127 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:03:26,127 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,127 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:26,127 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:26,127 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2022-07-14 16:03:26,127 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:26,127 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:26,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,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-07-14 16:03:26,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,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-07-14 16:03:26,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:26,346 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:26,346 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:03:26,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,364 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 16:03:26,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:26,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:26,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:26,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:26,372 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:26,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:26,372 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:26,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:26,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:26,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-14 16:03:26,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,445 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 16:03:26,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:26,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:26,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:26,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:26,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:26,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:26,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:26,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:26,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:26,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:26,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,478 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 16:03:26,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:26,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:26,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:26,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:26,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:26,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:26,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:26,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:26,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:26,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-14 16:03:26,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,506 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 16:03:26,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:26,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:26,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:26,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:26,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:26,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:26,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:26,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:26,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:26,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-14 16:03:26,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,530 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 16:03:26,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:26,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:26,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:26,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:26,540 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:26,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:26,540 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:26,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:26,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:26,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-14 16:03:26,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,558 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 16:03:26,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:26,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:26,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:26,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:26,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:26,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:26,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:26,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:26,574 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:03:26,575 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:03:26,575 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:03:26,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,577 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:26,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 16:03:26,579 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:03:26,579 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:03:26,579 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:03:26,579 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2022-07-14 16:03:26,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:26,596 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:03:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:26,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:03:26,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:26,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:03:26,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:26,723 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-14 16:03:26,723 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1174 states and 1938 transitions. cyclomatic complexity: 776 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:26,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1174 states and 1938 transitions. cyclomatic complexity: 776. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 1955 states and 3238 transitions. Complement of second has 5 states. [2022-07-14 16:03:26,760 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-07-14 16:03:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2022-07-14 16:03:26,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 371 transitions. Stem has 24 letters. Loop has 28 letters. [2022-07-14 16:03:26,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:26,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 371 transitions. Stem has 52 letters. Loop has 28 letters. [2022-07-14 16:03:26,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:26,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 371 transitions. Stem has 24 letters. Loop has 56 letters. [2022-07-14 16:03:26,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:26,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1955 states and 3238 transitions. [2022-07-14 16:03:26,770 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1128 [2022-07-14 16:03:26,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1955 states to 1955 states and 3238 transitions. [2022-07-14 16:03:26,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1206 [2022-07-14 16:03:26,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1215 [2022-07-14 16:03:26,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1955 states and 3238 transitions. [2022-07-14 16:03:26,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:26,788 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1955 states and 3238 transitions. [2022-07-14 16:03:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states and 3238 transitions. [2022-07-14 16:03:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1008. [2022-07-14 16:03:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1008 states have (on average 1.6547619047619047) internal successors, (1668), 1007 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1668 transitions. [2022-07-14 16:03:26,804 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1008 states and 1668 transitions. [2022-07-14 16:03:26,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 16:03:26,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 16:03:26,805 INFO L87 Difference]: Start difference. First operand 1008 states and 1668 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:26,857 INFO L93 Difference]: Finished difference Result 1032 states and 1681 transitions. [2022-07-14 16:03:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:03:26,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1032 states and 1681 transitions. [2022-07-14 16:03:26,884 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 579 [2022-07-14 16:03:26,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1032 states to 1032 states and 1681 transitions. [2022-07-14 16:03:26,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2022-07-14 16:03:26,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 659 [2022-07-14 16:03:26,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1032 states and 1681 transitions. [2022-07-14 16:03:26,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:26,888 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1032 states and 1681 transitions. [2022-07-14 16:03:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states and 1681 transitions. [2022-07-14 16:03:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 942. [2022-07-14 16:03:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 942 states have (on average 1.6358811040339702) internal successors, (1541), 941 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1541 transitions. [2022-07-14 16:03:26,899 INFO L392 hiAutomatonCegarLoop]: Abstraction has 942 states and 1541 transitions. [2022-07-14 16:03:26,899 INFO L374 stractBuchiCegarLoop]: Abstraction has 942 states and 1541 transitions. [2022-07-14 16:03:26,899 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 16:03:26,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 942 states and 1541 transitions. [2022-07-14 16:03:26,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:26,906 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 579 [2022-07-14 16:03:26,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:26,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:26,906 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:26,906 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:26,907 INFO L752 eck$LassoCheckResult]: Stem: 10268#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 10153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 10077#L416 assume !(1 == ~c_req_up~0); 10079#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 10258#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 10274#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 10119#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 10120#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 10253#L447-1 assume !(0 == ~e_f~0); 10129#L452-1 assume !(0 == ~e_g~0); 10130#L457-1 assume !(0 == ~e_e~0); 10264#L462-1 assume !(0 == ~e_c~0); 10265#L467-1 assume !(0 == ~e_wl~0); 10248#L472-1 assume !(1 == ~wl_pc~0); 10249#L484 assume !(2 == ~wl_pc~0); 10241#L485 assume !(1 == ~c1_pc~0); 10225#L495 assume !(1 == ~c2_pc~0); 10208#L504 assume !(1 == ~wb_pc~0); 10209#L513 assume !(1 == ~e_c~0); 10277#L522-1 assume !(1 == ~e_e~0); 10276#L527-1 assume !(1 == ~e_f~0); 10275#L532-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10132#L537-1 assume !(1 == ~e_c~0); 10174#L542-1 assume !(1 == ~e_wl~0); 10175#L684-1 assume !false; 10716#L554 [2022-07-14 16:03:26,907 INFO L754 eck$LassoCheckResult]: Loop: 10716#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 10717#L389 assume !false; 10712#L307 assume !(0 == ~wl_st~0); 10713#L311 assume !(0 == ~c1_st~0); 10708#L314 assume !(0 == ~c2_st~0); 10709#L317 assume !(0 == ~wb_st~0); 10702#L320 assume !(0 == ~r_st~0); 10704#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 10698#L560 assume !(1 == ~c_req_up~0); 10699#L560-2 start_simulation_~kernel_st~0#1 := 3; 10931#L572 assume !(0 == ~e_f~0); 10930#L572-2 assume !(0 == ~e_g~0); 10929#L577-1 assume !(0 == ~e_e~0); 10928#L582-1 assume !(0 == ~e_c~0); 10927#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10926#L592-1 assume 1 == ~wl_pc~0; 10924#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 10921#L605 assume !(1 == ~c1_pc~0); 10920#L615 assume !(1 == ~c2_pc~0); 10918#L624 assume !(1 == ~wb_pc~0); 10916#L633 assume !(1 == ~e_c~0); 10915#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10753#L647-1 assume !(1 == ~e_f~0); 10750#L652-1 assume !(1 == ~e_g~0); 10050#L657-1 assume !(1 == ~e_c~0); 10746#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10726#L667-1 assume 0 == ~wl_st~0; 10724#L684-1 assume !false; 10716#L554 [2022-07-14 16:03:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash -666236546, now seen corresponding path program 1 times [2022-07-14 16:03:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:26,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628732074] [2022-07-14 16:03:26,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:26,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628732074] [2022-07-14 16:03:26,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628732074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:26,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:26,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 16:03:26,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044642829] [2022-07-14 16:03:26,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:26,922 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1464581643, now seen corresponding path program 1 times [2022-07-14 16:03:26,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:26,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769488364] [2022-07-14 16:03:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:26,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:26,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:26,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:27,080 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:27,080 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:27,080 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:27,080 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:27,080 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:03:27,080 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,080 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:27,080 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:27,080 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration9_Loop [2022-07-14 16:03:27,080 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:27,080 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:27,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,282 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:27,282 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:03:27,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,284 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 16:03:27,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:27,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:27,307 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:27,307 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:27,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-14 16:03:27,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,324 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 16:03:27,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:27,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:27,347 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:27,347 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:27,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-14 16:03:27,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,364 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 16:03:27,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:27,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:27,383 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:27,383 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:27,398 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-07-14 16:03:27,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,400 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 16:03:27,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:27,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:27,423 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:27,423 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:27,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-14 16:03:27,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,440 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-14 16:03:27,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:27,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:27,463 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:27,463 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:27,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-14 16:03:27,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,480 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 16:03:27,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:27,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:27,503 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:27,503 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=-1} Honda state: {~wb_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:27,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:27,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,522 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 16:03:27,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:27,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:27,580 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-07-14 16:03:27,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,582 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-14 16:03:27,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:03:27,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:27,619 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:03:27,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:27,623 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:27,623 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:27,623 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:27,623 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:27,623 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:03:27,623 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,623 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:27,623 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:27,623 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration9_Loop [2022-07-14 16:03:27,623 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:27,623 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:27,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,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-07-14 16:03:27,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:03:27,838 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:27,838 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:03:27,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,840 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-14 16:03:27,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:27,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:27,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:27,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:27,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:27,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:27,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:27,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:27,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:27,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:27,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,865 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-14 16:03:27,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:27,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:27,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:27,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:27,873 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:27,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:27,874 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:27,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:27,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:27,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:27,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,898 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-14 16:03:27,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:27,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:27,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:27,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:27,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:27,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:27,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:27,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:27,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:27,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-14 16:03:27,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,925 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-14 16:03:27,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:27,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:27,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:27,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:27,932 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:27,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:27,933 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:27,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:27,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:27,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:27,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,953 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-14 16:03:27,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:27,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:27,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:27,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:27,961 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:27,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:27,962 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:27,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:27,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:27,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:27,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:27,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:27,990 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:27,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-14 16:03:27,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:27,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:27,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:27,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:27,998 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:27,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:27,999 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:27,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:28,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:28,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-14 16:03:28,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,017 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:28,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-14 16:03:28,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:28,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:28,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:28,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:28,045 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:28,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:28,047 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:28,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:28,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:28,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:28,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,066 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:28,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-14 16:03:28,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:28,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:28,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:28,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:28,073 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:28,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:28,074 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:28,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:28,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:28,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:28,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,093 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:28,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-14 16:03:28,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:28,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:28,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:28,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:28,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:28,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:28,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:28,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:28,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:28,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-14 16:03:28,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,139 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:28,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-14 16:03:28,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-07-14 16:03:28,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:28,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:28,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:28,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:28,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:28,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:28,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:28,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:28,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:28,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,165 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:28,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-14 16:03:28,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:28,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:28,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:28,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:28,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:28,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:28,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:28,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:28,197 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:03:28,199 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:03:28,199 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:03:28,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,201 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:28,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-14 16:03:28,204 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:03:28,204 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:03:28,204 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:03:28,204 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -2*~e_e~0 + 3 Supporting invariants [] [2022-07-14 16:03:28,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:28,220 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:03:28,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:28,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:03:28,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:28,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:03:28,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:28,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 16:03:28,356 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 942 states and 1541 transitions. cyclomatic complexity: 608 Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:28,386 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 942 states and 1541 transitions. cyclomatic complexity: 608. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 2635 states and 4302 transitions. Complement of second has 5 states. [2022-07-14 16:03:28,386 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-07-14 16:03:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-07-14 16:03:28,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 28 letters. [2022-07-14 16:03:28,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:28,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 53 letters. Loop has 28 letters. [2022-07-14 16:03:28,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:28,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 56 letters. [2022-07-14 16:03:28,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:28,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2635 states and 4302 transitions. [2022-07-14 16:03:28,399 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1122 [2022-07-14 16:03:28,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2635 states to 2635 states and 4302 transitions. [2022-07-14 16:03:28,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1202 [2022-07-14 16:03:28,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1223 [2022-07-14 16:03:28,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2635 states and 4302 transitions. [2022-07-14 16:03:28,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:28,410 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2635 states and 4302 transitions. [2022-07-14 16:03:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states and 4302 transitions. [2022-07-14 16:03:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2614. [2022-07-14 16:03:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2614 states have (on average 1.632364192807957) internal successors, (4267), 2613 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 4267 transitions. [2022-07-14 16:03:28,442 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2614 states and 4267 transitions. [2022-07-14 16:03:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:28,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 16:03:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 16:03:28,442 INFO L87 Difference]: Start difference. First operand 2614 states and 4267 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:28,493 INFO L93 Difference]: Finished difference Result 3358 states and 5390 transitions. [2022-07-14 16:03:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 16:03:28,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3358 states and 5390 transitions. [2022-07-14 16:03:28,508 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1296 [2022-07-14 16:03:28,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3358 states to 3358 states and 5390 transitions. [2022-07-14 16:03:28,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1360 [2022-07-14 16:03:28,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1360 [2022-07-14 16:03:28,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3358 states and 5390 transitions. [2022-07-14 16:03:28,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:28,520 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3358 states and 5390 transitions. [2022-07-14 16:03:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states and 5390 transitions. [2022-07-14 16:03:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3358. [2022-07-14 16:03:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 3358 states have (on average 1.6051220964860036) internal successors, (5390), 3357 states have internal predecessors, (5390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 5390 transitions. [2022-07-14 16:03:28,563 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3358 states and 5390 transitions. [2022-07-14 16:03:28,564 INFO L374 stractBuchiCegarLoop]: Abstraction has 3358 states and 5390 transitions. [2022-07-14 16:03:28,564 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 16:03:28,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3358 states and 5390 transitions. [2022-07-14 16:03:28,574 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1296 [2022-07-14 16:03:28,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:28,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:28,577 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:28,577 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:28,577 INFO L752 eck$LassoCheckResult]: Stem: 20025#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 19885#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 19809#L416 assume !(1 == ~c_req_up~0); 19811#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 19925#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 19926#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 19946#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 19883#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 19884#L447-1 assume !(0 == ~e_f~0); 20045#L452-1 assume !(0 == ~e_g~0); 19769#L457-1 assume !(0 == ~e_e~0); 19770#L462-1 assume !(0 == ~e_c~0); 19825#L467-1 assume !(0 == ~e_wl~0); 19826#L472-1 assume !(1 == ~wl_pc~0); 20040#L484 assume !(2 == ~wl_pc~0); 19982#L485 assume !(1 == ~c1_pc~0); 19827#L495 assume !(1 == ~c2_pc~0); 19829#L504 assume !(1 == ~wb_pc~0); 19951#L513 assume !(1 == ~e_c~0); 19986#L522-1 assume !(1 == ~e_e~0); 20000#L527-1 assume !(1 == ~e_f~0); 19863#L532-1 assume !(1 == ~e_g~0); 19864#L537-1 assume !(1 == ~e_c~0); 19911#L542-1 assume !(1 == ~e_wl~0); 19912#L684-1 assume !false; 20589#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 21512#L389 [2022-07-14 16:03:28,578 INFO L754 eck$LassoCheckResult]: Loop: 21512#L389 assume !false; 22367#L307 assume 0 == ~wl_st~0; 22354#L320-1 assume !(0 == ~wl_st~0); 22631#L329 assume !(0 == ~c1_st~0); 22497#L344 assume !(0 == ~c2_st~0); 22493#L359 assume !(0 == ~wb_st~0); 22489#L374 assume !(0 == ~r_st~0); 21512#L389 [2022-07-14 16:03:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2022-07-14 16:03:28,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912875399] [2022-07-14 16:03:28,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:28,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:28,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash 129447733, now seen corresponding path program 1 times [2022-07-14 16:03:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651117100] [2022-07-14 16:03:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:28,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:28,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651117100] [2022-07-14 16:03:28,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651117100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:28,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:28,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:28,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833161482] [2022-07-14 16:03:28,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:28,627 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:28,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:28,628 INFO L87 Difference]: Start difference. First operand 3358 states and 5390 transitions. cyclomatic complexity: 2068 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:28,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-14 16:03:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:28,657 INFO L93 Difference]: Finished difference Result 5264 states and 8290 transitions. [2022-07-14 16:03:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:28,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5264 states and 8290 transitions. [2022-07-14 16:03:28,672 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2044 [2022-07-14 16:03:28,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5264 states to 5264 states and 8290 transitions. [2022-07-14 16:03:28,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2110 [2022-07-14 16:03:28,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2110 [2022-07-14 16:03:28,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5264 states and 8290 transitions. [2022-07-14 16:03:28,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:28,690 INFO L369 hiAutomatonCegarLoop]: Abstraction has 5264 states and 8290 transitions. [2022-07-14 16:03:28,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states and 8290 transitions. [2022-07-14 16:03:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 5264. [2022-07-14 16:03:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5264 states, 5264 states have (on average 1.5748480243161094) internal successors, (8290), 5263 states have internal predecessors, (8290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5264 states to 5264 states and 8290 transitions. [2022-07-14 16:03:28,748 INFO L392 hiAutomatonCegarLoop]: Abstraction has 5264 states and 8290 transitions. [2022-07-14 16:03:28,748 INFO L374 stractBuchiCegarLoop]: Abstraction has 5264 states and 8290 transitions. [2022-07-14 16:03:28,748 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 16:03:28,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5264 states and 8290 transitions. [2022-07-14 16:03:28,757 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2044 [2022-07-14 16:03:28,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:28,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:28,758 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:28,758 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:28,758 INFO L752 eck$LassoCheckResult]: Stem: 28670#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 28522#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 28444#L416 assume !(1 == ~c_req_up~0); 28446#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 28656#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 28685#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 28684#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 28520#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 28521#L447-1 assume !(0 == ~e_f~0); 28681#L452-1 assume !(0 == ~e_g~0); 28397#L457-1 assume !(0 == ~e_e~0); 28398#L462-1 assume !(0 == ~e_c~0); 28457#L467-1 assume !(0 == ~e_wl~0); 28458#L472-1 assume !(1 == ~wl_pc~0); 28691#L484 assume !(2 == ~wl_pc~0); 28629#L485 assume !(1 == ~c1_pc~0); 28613#L495 assume !(1 == ~c2_pc~0); 28687#L504 assume !(1 == ~wb_pc~0); 28632#L513 assume !(1 == ~e_c~0); 28428#L522-1 assume !(1 == ~e_e~0); 28429#L527-1 assume !(1 == ~e_f~0); 28682#L532-1 assume !(1 == ~e_g~0); 28616#L537-1 assume !(1 == ~e_c~0); 28545#L542-1 assume !(1 == ~e_wl~0); 28546#L684-1 assume !false; 30832#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 31437#L389 [2022-07-14 16:03:28,758 INFO L754 eck$LassoCheckResult]: Loop: 31437#L389 assume !false; 32648#L307 assume 0 == ~wl_st~0; 32416#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 32633#L333 assume !(0 != eval_~tmp~0#1); 32642#L329 assume !(0 == ~c1_st~0); 32672#L344 assume !(0 == ~c2_st~0); 32664#L359 assume !(0 == ~wb_st~0); 32656#L374 assume !(0 == ~r_st~0); 31437#L389 [2022-07-14 16:03:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2022-07-14 16:03:28,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502805962] [2022-07-14 16:03:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:28,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:28,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1292266880, now seen corresponding path program 1 times [2022-07-14 16:03:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500806737] [2022-07-14 16:03:28,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:28,770 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:28,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:28,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash 373312376, now seen corresponding path program 1 times [2022-07-14 16:03:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265958502] [2022-07-14 16:03:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:28,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:28,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265958502] [2022-07-14 16:03:28,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265958502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:28,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:28,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090920469] [2022-07-14 16:03:28,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:28,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:28,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:28,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:28,803 INFO L87 Difference]: Start difference. First operand 5264 states and 8290 transitions. cyclomatic complexity: 3062 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:28,835 INFO L93 Difference]: Finished difference Result 8154 states and 12722 transitions. [2022-07-14 16:03:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:28,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8154 states and 12722 transitions. [2022-07-14 16:03:28,859 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 3194 [2022-07-14 16:03:28,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8154 states to 8154 states and 12722 transitions. [2022-07-14 16:03:28,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3262 [2022-07-14 16:03:28,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3262 [2022-07-14 16:03:28,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8154 states and 12722 transitions. [2022-07-14 16:03:28,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:28,929 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8154 states and 12722 transitions. [2022-07-14 16:03:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8154 states and 12722 transitions. [2022-07-14 16:03:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8154 to 8154. [2022-07-14 16:03:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8154 states, 8154 states have (on average 1.5602158449840569) internal successors, (12722), 8153 states have internal predecessors, (12722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 12722 transitions. [2022-07-14 16:03:29,018 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8154 states and 12722 transitions. [2022-07-14 16:03:29,018 INFO L374 stractBuchiCegarLoop]: Abstraction has 8154 states and 12722 transitions. [2022-07-14 16:03:29,018 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 16:03:29,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8154 states and 12722 transitions. [2022-07-14 16:03:29,035 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 3194 [2022-07-14 16:03:29,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:29,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:29,035 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:29,036 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:29,036 INFO L752 eck$LassoCheckResult]: Stem: 42094#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 41948#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 41865#L416 assume !(1 == ~c_req_up~0); 41867#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 41989#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 41990#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 42010#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 41946#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 41947#L447-1 assume !(0 == ~e_f~0); 42111#L452-1 assume !(0 == ~e_g~0); 41823#L457-1 assume !(0 == ~e_e~0); 41824#L462-1 assume !(0 == ~e_c~0); 41883#L467-1 assume !(0 == ~e_wl~0); 41884#L472-1 assume !(1 == ~wl_pc~0); 42107#L484 assume !(2 == ~wl_pc~0); 42047#L485 assume !(1 == ~c1_pc~0); 41885#L495 assume !(1 == ~c2_pc~0); 41887#L504 assume !(1 == ~wb_pc~0); 42016#L513 assume !(1 == ~e_c~0); 42052#L522-1 assume !(1 == ~e_e~0); 42069#L527-1 assume !(1 == ~e_f~0); 41923#L532-1 assume !(1 == ~e_g~0); 41924#L537-1 assume !(1 == ~e_c~0); 42038#L542-1 assume !(1 == ~e_wl~0); 44028#L684-1 assume !false; 44029#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 47350#L389 [2022-07-14 16:03:29,036 INFO L754 eck$LassoCheckResult]: Loop: 47350#L389 assume !false; 47412#L307 assume 0 == ~wl_st~0; 47380#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 47376#L333 assume !(0 != eval_~tmp~0#1); 47408#L329 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 47429#L348 assume !(0 != eval_~tmp___0~0#1); 47428#L344 assume !(0 == ~c2_st~0); 47422#L359 assume !(0 == ~wb_st~0); 47417#L374 assume !(0 == ~r_st~0); 47350#L389 [2022-07-14 16:03:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2022-07-14 16:03:29,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:29,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085450436] [2022-07-14 16:03:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:29,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,040 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:29,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1353841090, now seen corresponding path program 1 times [2022-07-14 16:03:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:29,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964208740] [2022-07-14 16:03:29,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:29,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1363944758, now seen corresponding path program 1 times [2022-07-14 16:03:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:29,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108137361] [2022-07-14 16:03:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:29,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:29,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108137361] [2022-07-14 16:03:29,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108137361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:29,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:29,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:29,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544563739] [2022-07-14 16:03:29,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:29,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:29,086 INFO L87 Difference]: Start difference. First operand 8154 states and 12722 transitions. cyclomatic complexity: 4604 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:29,173 INFO L93 Difference]: Finished difference Result 12961 states and 20031 transitions. [2022-07-14 16:03:29,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:29,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12961 states and 20031 transitions. [2022-07-14 16:03:29,211 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2022-07-14 16:03:29,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12961 states to 12961 states and 20031 transitions. [2022-07-14 16:03:29,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5220 [2022-07-14 16:03:29,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5220 [2022-07-14 16:03:29,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12961 states and 20031 transitions. [2022-07-14 16:03:29,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:29,244 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12961 states and 20031 transitions. [2022-07-14 16:03:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states and 20031 transitions. [2022-07-14 16:03:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12961. [2022-07-14 16:03:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12961 states have (on average 1.5454826016511072) internal successors, (20031), 12960 states have internal predecessors, (20031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 20031 transitions. [2022-07-14 16:03:29,407 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12961 states and 20031 transitions. [2022-07-14 16:03:29,407 INFO L374 stractBuchiCegarLoop]: Abstraction has 12961 states and 20031 transitions. [2022-07-14 16:03:29,407 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-14 16:03:29,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12961 states and 20031 transitions. [2022-07-14 16:03:29,431 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2022-07-14 16:03:29,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:29,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:29,431 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:29,431 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:29,431 INFO L752 eck$LassoCheckResult]: Stem: 63235#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 63070#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 62989#L416 assume !(1 == ~c_req_up~0); 62991#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 63214#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 63143#L432-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 63144#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 63068#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 63069#L447-1 assume !(0 == ~e_f~0); 65402#L452-1 assume !(0 == ~e_g~0); 65400#L457-1 assume !(0 == ~e_e~0); 65398#L462-1 assume !(0 == ~e_c~0); 63258#L467-1 assume !(0 == ~e_wl~0); 63255#L472-1 assume !(1 == ~wl_pc~0); 63256#L484 assume !(2 == ~wl_pc~0); 63181#L485 assume !(1 == ~c1_pc~0); 63166#L495 assume !(1 == ~c2_pc~0); 63150#L504 assume !(1 == ~wb_pc~0); 63151#L513 assume !(1 == ~e_c~0); 63186#L522-1 assume !(1 == ~e_e~0); 63206#L527-1 assume !(1 == ~e_f~0); 63207#L532-1 assume !(1 == ~e_g~0); 65367#L537-1 assume !(1 == ~e_c~0); 65364#L542-1 assume !(1 == ~e_wl~0); 65361#L684-1 assume !false; 65362#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 69536#L389 [2022-07-14 16:03:29,431 INFO L754 eck$LassoCheckResult]: Loop: 69536#L389 assume !false; 72687#L307 assume 0 == ~wl_st~0; 72675#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 72661#L333 assume !(0 != eval_~tmp~0#1); 72686#L329 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 72733#L348 assume !(0 != eval_~tmp___0~0#1); 72730#L344 assume !(0 == ~c2_st~0); 72728#L359 assume !(0 == ~wb_st~0); 72696#L374 assume !(0 == ~r_st~0); 69536#L389 [2022-07-14 16:03:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2022-07-14 16:03:29,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:29,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984430953] [2022-07-14 16:03:29,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:29,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:29,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:29,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984430953] [2022-07-14 16:03:29,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984430953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:29,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:29,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:29,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993713396] [2022-07-14 16:03:29,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:29,442 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1353841090, now seen corresponding path program 2 times [2022-07-14 16:03:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:29,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246441158] [2022-07-14 16:03:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:29,470 INFO L87 Difference]: Start difference. First operand 12961 states and 20031 transitions. cyclomatic complexity: 7106 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:29,581 INFO L93 Difference]: Finished difference Result 12909 states and 19944 transitions. [2022-07-14 16:03:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:29,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12909 states and 19944 transitions. [2022-07-14 16:03:29,610 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2022-07-14 16:03:29,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12909 states to 12909 states and 19944 transitions. [2022-07-14 16:03:29,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5170 [2022-07-14 16:03:29,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5170 [2022-07-14 16:03:29,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12909 states and 19944 transitions. [2022-07-14 16:03:29,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:29,636 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12909 states and 19944 transitions. [2022-07-14 16:03:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states and 19944 transitions. [2022-07-14 16:03:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 12909. [2022-07-14 16:03:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12909 states, 12909 states have (on average 1.5449686265396234) internal successors, (19944), 12908 states have internal predecessors, (19944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12909 states to 12909 states and 19944 transitions. [2022-07-14 16:03:29,854 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12909 states and 19944 transitions. [2022-07-14 16:03:29,854 INFO L374 stractBuchiCegarLoop]: Abstraction has 12909 states and 19944 transitions. [2022-07-14 16:03:29,854 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-14 16:03:29,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12909 states and 19944 transitions. [2022-07-14 16:03:29,879 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2022-07-14 16:03:29,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:29,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:29,880 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:29,880 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:29,880 INFO L752 eck$LassoCheckResult]: Stem: 89090#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 88945#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 88866#L416 assume !(1 == ~c_req_up~0); 88868#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 88989#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 88990#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 89009#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 88943#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 88944#L447-1 assume !(0 == ~e_f~0); 89109#L452-1 assume !(0 == ~e_g~0); 88823#L457-1 assume !(0 == ~e_e~0); 88824#L462-1 assume !(0 == ~e_c~0); 88882#L467-1 assume !(0 == ~e_wl~0); 88883#L472-1 assume !(1 == ~wl_pc~0); 89104#L484 assume !(2 == ~wl_pc~0); 89044#L485 assume !(1 == ~c1_pc~0); 88884#L495 assume !(1 == ~c2_pc~0); 88886#L504 assume !(1 == ~wb_pc~0); 89016#L513 assume !(1 == ~e_c~0); 89047#L522-1 assume !(1 == ~e_e~0); 89066#L527-1 assume !(1 == ~e_f~0); 88920#L532-1 assume !(1 == ~e_g~0); 88921#L537-1 assume !(1 == ~e_c~0); 88973#L542-1 assume !(1 == ~e_wl~0); 88974#L684-1 assume !false; 91954#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 97100#L389 [2022-07-14 16:03:29,880 INFO L754 eck$LassoCheckResult]: Loop: 97100#L389 assume !false; 97096#L307 assume 0 == ~wl_st~0; 97057#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 97053#L333 assume !(0 != eval_~tmp~0#1); 97088#L329 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 97126#L348 assume !(0 != eval_~tmp___0~0#1); 97125#L344 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 97099#L363 assume !(0 != eval_~tmp___1~0#1); 97120#L359 assume !(0 == ~wb_st~0); 97106#L374 assume !(0 == ~r_st~0); 97100#L389 [2022-07-14 16:03:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2022-07-14 16:03:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:29,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972846073] [2022-07-14 16:03:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:29,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:29,890 INFO L85 PathProgramCache]: Analyzing trace with hash -982249908, now seen corresponding path program 1 times [2022-07-14 16:03:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:29,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104565833] [2022-07-14 16:03:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:29,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,891 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:29,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:29,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash 665734724, now seen corresponding path program 1 times [2022-07-14 16:03:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:29,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869970410] [2022-07-14 16:03:29,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:29,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:29,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869970410] [2022-07-14 16:03:29,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869970410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:29,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:29,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004396116] [2022-07-14 16:03:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:29,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:29,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:29,953 INFO L87 Difference]: Start difference. First operand 12909 states and 19944 transitions. cyclomatic complexity: 7071 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:30,057 INFO L93 Difference]: Finished difference Result 20133 states and 30924 transitions. [2022-07-14 16:03:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:30,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20133 states and 30924 transitions. [2022-07-14 16:03:30,169 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 8032 [2022-07-14 16:03:30,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20133 states to 20133 states and 30924 transitions. [2022-07-14 16:03:30,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8104 [2022-07-14 16:03:30,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8104 [2022-07-14 16:03:30,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20133 states and 30924 transitions. [2022-07-14 16:03:30,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:30,301 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20133 states and 30924 transitions. [2022-07-14 16:03:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20133 states and 30924 transitions. [2022-07-14 16:03:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20133 to 20013. [2022-07-14 16:03:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20013 states, 20013 states have (on average 1.5391995203117974) internal successors, (30804), 20012 states have internal predecessors, (30804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 30804 transitions. [2022-07-14 16:03:30,597 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20013 states and 30804 transitions. [2022-07-14 16:03:30,597 INFO L374 stractBuchiCegarLoop]: Abstraction has 20013 states and 30804 transitions. [2022-07-14 16:03:30,597 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-14 16:03:30,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20013 states and 30804 transitions. [2022-07-14 16:03:30,635 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7984 [2022-07-14 16:03:30,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:30,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:30,639 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:30,639 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:30,639 INFO L752 eck$LassoCheckResult]: Stem: 122155#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 121994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 121913#L416 assume !(1 == ~c_req_up~0); 121915#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 122041#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 122042#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 122064#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 121992#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 121993#L447-1 assume !(0 == ~e_f~0); 122183#L452-1 assume !(0 == ~e_g~0); 121870#L457-1 assume !(0 == ~e_e~0); 121871#L462-1 assume !(0 == ~e_c~0); 121930#L467-1 assume !(0 == ~e_wl~0); 121931#L472-1 assume !(1 == ~wl_pc~0); 122179#L484 assume !(2 == ~wl_pc~0); 122105#L485 assume !(1 == ~c1_pc~0); 121932#L495 assume !(1 == ~c2_pc~0); 121934#L504 assume !(1 == ~wb_pc~0); 122071#L513 assume !(1 == ~e_c~0); 122110#L522-1 assume !(1 == ~e_e~0); 122127#L527-1 assume !(1 == ~e_f~0); 121969#L532-1 assume !(1 == ~e_g~0); 121970#L537-1 assume !(1 == ~e_c~0); 122094#L542-1 assume !(1 == ~e_wl~0); 127270#L684-1 assume !false; 127271#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 134004#L389 [2022-07-14 16:03:30,639 INFO L754 eck$LassoCheckResult]: Loop: 134004#L389 assume !false; 134700#L307 assume 0 == ~wl_st~0; 134697#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 134672#L333 assume !(0 != eval_~tmp~0#1); 134694#L329 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 135041#L348 assume !(0 != eval_~tmp___0~0#1); 135040#L344 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 135038#L363 assume !(0 != eval_~tmp___1~0#1); 135037#L359 assume 0 == ~wb_st~0;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 135021#L378 assume !(0 != eval_~tmp___2~0#1); 135034#L374 assume !(0 == ~r_st~0); 134004#L389 [2022-07-14 16:03:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 5 times [2022-07-14 16:03:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494479125] [2022-07-14 16:03:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -385011466, now seen corresponding path program 1 times [2022-07-14 16:03:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661272456] [2022-07-14 16:03:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,658 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:30,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash -837095426, now seen corresponding path program 1 times [2022-07-14 16:03:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556896311] [2022-07-14 16:03:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,666 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:31,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 04:03:31 BoogieIcfgContainer [2022-07-14 16:03:31,394 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 16:03:31,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 16:03:31,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 16:03:31,395 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 16:03:31,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:03:22" (3/4) ... [2022-07-14 16:03:31,399 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 16:03:31,436 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 16:03:31,436 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 16:03:31,437 INFO L158 Benchmark]: Toolchain (without parser) took 9294.22ms. Allocated memory was 123.7MB in the beginning and 497.0MB in the end (delta: 373.3MB). Free memory was 87.7MB in the beginning and 243.6MB in the end (delta: -155.9MB). Peak memory consumption was 218.1MB. Max. memory is 16.1GB. [2022-07-14 16:03:31,437 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory was 93.9MB in the beginning and 93.9MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:03:31,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.78ms. Allocated memory is still 123.7MB. Free memory was 87.5MB in the beginning and 94.9MB in the end (delta: -7.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 16:03:31,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.53ms. Allocated memory is still 123.7MB. Free memory was 94.9MB in the beginning and 92.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:03:31,438 INFO L158 Benchmark]: Boogie Preprocessor took 32.36ms. Allocated memory is still 123.7MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:03:31,438 INFO L158 Benchmark]: RCFGBuilder took 467.42ms. Allocated memory is still 123.7MB. Free memory was 90.7MB in the beginning and 71.3MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-14 16:03:31,438 INFO L158 Benchmark]: BuchiAutomizer took 8408.27ms. Allocated memory was 123.7MB in the beginning and 497.0MB in the end (delta: 373.3MB). Free memory was 71.3MB in the beginning and 245.6MB in the end (delta: -174.4MB). Peak memory consumption was 270.9MB. Max. memory is 16.1GB. [2022-07-14 16:03:31,438 INFO L158 Benchmark]: Witness Printer took 41.84ms. Allocated memory is still 497.0MB. Free memory was 245.6MB in the beginning and 243.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:03:31,440 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory was 93.9MB in the beginning and 93.9MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.78ms. Allocated memory is still 123.7MB. Free memory was 87.5MB in the beginning and 94.9MB in the end (delta: -7.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.53ms. Allocated memory is still 123.7MB. Free memory was 94.9MB in the beginning and 92.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.36ms. Allocated memory is still 123.7MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 467.42ms. Allocated memory is still 123.7MB. Free memory was 90.7MB in the beginning and 71.3MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 8408.27ms. Allocated memory was 123.7MB in the beginning and 497.0MB in the end (delta: 373.3MB). Free memory was 71.3MB in the beginning and 245.6MB in the end (delta: -174.4MB). Peak memory consumption was 270.9MB. Max. memory is 16.1GB. * Witness Printer took 41.84ms. Allocated memory is still 497.0MB. Free memory was 245.6MB in the beginning and 243.6MB in the end (delta: 2.0MB). 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 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function 3 + -2 * e_e and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 20013 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 5.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 1393 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4135 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4132 mSDsluCounter, 6565 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2288 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 4277 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital83 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf100 smp100 dnf211 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 306]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p_out=0, wb_st=0, NULL=0, processed=0, tmp___3=0, __retres1=0, NULL=1, tmp___2=0, c2_st=0, wl_pc=0, e_wl=2, e_c=2, e_e=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d0db026=0, e_p_in=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@378b7ba0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@306abbe2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5da335bb=0, t_b=0, p_in=0, wb_pc=0, data=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@494752d1=0, wb_i=1, tmp___1=0, c_req_up=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, c1_i=1, c2_pc=0, c2_i=1, tmp=0, tmp___0=0, \result=0, r_i=0, d=0, e_f=2, e_g=2, NULL=0, kernel_st=1, r_st=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 306]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] kernel_st = 0 [L416] COND FALSE !((int )c_req_up == 1) [L427] COND TRUE (int )wl_i == 1 [L428] wl_st = 0 [L432] COND TRUE (int )c1_i == 1 [L433] c1_st = 0 [L437] COND TRUE (int )c2_i == 1 [L438] c2_st = 0 [L442] COND TRUE (int )wb_i == 1 [L443] wb_st = 0 [L447] COND FALSE !((int )r_i == 1) [L450] r_st = 2 [L452] COND FALSE !((int )e_f == 0) [L457] COND FALSE !((int )e_g == 0) [L462] COND FALSE !((int )e_e == 0) [L467] COND FALSE !((int )e_c == 0) [L472] COND FALSE !((int )e_wl == 0) [L477] COND FALSE !((int )wl_pc == 1) [L485] COND FALSE !((int )wl_pc == 2) [L495] COND FALSE !((int )c1_pc == 1) [L504] COND FALSE !((int )c2_pc == 1) [L513] COND FALSE !((int )wb_pc == 1) [L522] COND FALSE !((int )e_c == 1) [L527] COND FALSE !((int )e_e == 1) [L532] COND FALSE !((int )e_f == 1) [L537] COND FALSE !((int )e_g == 1) [L542] COND FALSE !((int )e_c == 1) [L547] COND FALSE !((int )e_wl == 1) [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; Loop: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-14 16:03:31,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)